書目名稱Graph-Theoretic Concepts in Computer Science影響因子(影響力)學(xué)科排名
書目名稱Graph-Theoretic Concepts in Computer Science網(wǎng)絡(luò)公開度
書目名稱Graph-Theoretic Concepts in Computer Science網(wǎng)絡(luò)公開度學(xué)科排名
書目名稱Graph-Theoretic Concepts in Computer Science被引頻次
書目名稱Graph-Theoretic Concepts in Computer Science被引頻次學(xué)科排名
書目名稱Graph-Theoretic Concepts in Computer Science年度引用
書目名稱Graph-Theoretic Concepts in Computer Science年度引用學(xué)科排名
書目名稱Graph-Theoretic Concepts in Computer Science讀者反饋
書目名稱Graph-Theoretic Concepts in Computer Science讀者反饋學(xué)科排名
作者: 入會 時間: 2025-3-21 20:15 作者: Ingrained 時間: 2025-3-22 01:47 作者: Acetaldehyde 時間: 2025-3-22 05:05
The malleability of ,,,We prove that the local search optimization problem TSP., though not known to be PLS-complete, shares an important infeasibility property with other PLS-complete sets.作者: 交響樂 時間: 2025-3-22 11:42
Graph-Theoretic Concepts in Computer Science978-3-540-48487-5Series ISSN 0302-9743 Series E-ISSN 1611-3349 作者: Crater 時間: 2025-3-22 16:21 作者: Crater 時間: 2025-3-22 17:41
Gruppen, Teams und Spitzenteams,n described by a specific formalism, both have given rise to many significant developments and many works have been devoted to the comparison of both approaches. In this paper, we describe a new categorical formalism, which provides a common framework to both approaches and makes their comparison much clearer.作者: crease 時間: 2025-3-22 22:13 作者: indigenous 時間: 2025-3-23 03:57
A uniform approach to graph rewriting: The pullback approach,n described by a specific formalism, both have given rise to many significant developments and many works have been devoted to the comparison of both approaches. In this paper, we describe a new categorical formalism, which provides a common framework to both approaches and makes their comparison much clearer.作者: 令人心醉 時間: 2025-3-23 06:40
VC-dimensions for graphs (extended abstract),ar, tree, etc. We derive a variety of combinatorial and computational results on the VC (Vapnik-Chervonenkis) dimension of these set systems..For most of these set systems (e.g. for the systems induced by trees, connected sets, or paths), computing the VC-dimension is an NP-hard problem. Moreover, d作者: capsaicin 時間: 2025-3-23 11:22
Finding and counting small induced subgraphs efficiently,es in the graph and .(..) is the time needed to perform a fast matrix multiplication. The second algorithm can be implemented to run in ., where . is the number of edges in the graph..We present a new algorithm for the recognition of diamond-free graphs that can be implemented to run in time ...We a作者: 率直 時間: 2025-3-23 13:56
On the isomorphism of graphs with few P4s, some local sense — only a small number of induced paths of length three. As it turns out, every such graph has a unique tree representation: the internal nodes correspond to three types of graph operations and the leaves are basic graphs with a simple structure. The paper extends and generalizes re作者: conifer 時間: 2025-3-23 22:01
A dynamic algorithm for line graph recognition,of finding . for a given . was already optimally solved by .[7] and .[11]. Here we present a new dynamic solution to this problem, where we can add or delete a node . in . in time proportional to the size of its adjacency list.作者: FORGO 時間: 2025-3-24 00:06
Planarization of graphs embedded on surfaces, degree . and orientable genus ., then there exists a planarizing set of .(√.) edges. This result is tight within a constant factor. Similar results are obtained for planarizing vertex sets and for graphs embedded on nonorientable surfaces. Planarizing edge and vertex sets can be found in . time, if作者: Cytology 時間: 2025-3-24 04:01 作者: assent 時間: 2025-3-24 06:43 作者: 高調(diào) 時間: 2025-3-24 12:12
A uniform approach to graph rewriting: The pullback approach,n described by a specific formalism, both have given rise to many significant developments and many works have been devoted to the comparison of both approaches. In this paper, we describe a new categorical formalism, which provides a common framework to both approaches and makes their comparison mu作者: Chameleon 時間: 2025-3-24 18:34
Visualizing two- and three-dimensional models of meristematic growth,em development has been extensively studied in the literature. This paper presents several two- and three-dimensional map and cellwork L-system models that simulate patterns described by Lück and Lück [11]. The advantage of these models over their predecessors is that, through the use of a geometric作者: 清楚說話 時間: 2025-3-24 22:00
Graph-theoretical methods to construct entity-relationship databases,ata are modelled as entity and relationship types. Usually relationship types come along with certain restrictions that influence the structure of databases. Cardinality constraints are the most commonly used class of constraints used to model such restrictions. Database instances satisfying given c作者: Amylase 時間: 2025-3-24 23:53
On Interval Routing Schemes and treewidth,how that for each fixed .≥1, the class of graphs allowing such routing schemes is closed under minor-taking in the domain of connected graphs, and hence has a linear time recognition algorithm. This result connects the theory of compact routing with the theory of graph minors and treewidth..We also 作者: semiskilled 時間: 2025-3-25 03:59
Highly fault-tolerant routings and diameter vulnerability for generalized hypercube graphs,n each pair of nodes) must be chosen without knowing which components might become faulty. The diameter of the surviving route graph ., where the surviving route graph . is a directed graph consisting of all nonfaulty nodes in . with a directed edge from . to . iff there are no faults on the route f作者: 分開如此和諧 時間: 2025-3-25 11:01
Hot-potato routing on multi-dimensional tori,s are always moving..A probabilistic hot-potato routing protocol is presented that routes random functions on the (.)-torus. If at most d/88 .. packets, evenly distributed among the processors, have to be routed, they all have reached their destinations in .+.(..log .) steps, with high probability, 作者: 悲痛 時間: 2025-3-25 12:26 作者: Initial 時間: 2025-3-25 19:50 作者: 愚笨 時間: 2025-3-25 23:45
Zusammenfassung der Ergebnisse,ar, tree, etc. We derive a variety of combinatorial and computational results on the VC (Vapnik-Chervonenkis) dimension of these set systems..For most of these set systems (e.g. for the systems induced by trees, connected sets, or paths), computing the VC-dimension is an NP-hard problem. Moreover, d作者: 膽大 時間: 2025-3-26 01:55
,Geschlecht – Konkurrenz – Androzentrismus,es in the graph and .(..) is the time needed to perform a fast matrix multiplication. The second algorithm can be implemented to run in ., where . is the number of edges in the graph..We present a new algorithm for the recognition of diamond-free graphs that can be implemented to run in time ...We a作者: congenial 時間: 2025-3-26 05:01 作者: aspersion 時間: 2025-3-26 11:36
https://doi.org/10.1007/978-3-322-90769-1of finding . for a given . was already optimally solved by .[7] and .[11]. Here we present a new dynamic solution to this problem, where we can add or delete a node . in . in time proportional to the size of its adjacency list.作者: essential-fats 時間: 2025-3-26 14:23 作者: 染色體 時間: 2025-3-26 17:39
Holger Dannenberg,Dirk Zupancichese problems involve the selection of a specified number of facilities (i.e. a placement of a specified size) to minimize a function of one distance metric subject to a budget constraint on the other distance metric. Such problems arise in several application areas including statistical clustering,作者: mendacity 時間: 2025-3-27 00:28
Die Spitzenbanken: Auswahl und Profil,being certain minimal derivations in which each step depends on previous steps. This characterization differs from corresponding results for term rewriting in that the latter hold only for subclasses of term rewriting systems. When applied to term graph rewriting, the result characterizes terminatio作者: 高射炮 時間: 2025-3-27 04:36 作者: 疏忽 時間: 2025-3-27 08:11
SEL Standard Elektrik Lorenz AGem development has been extensively studied in the literature. This paper presents several two- and three-dimensional map and cellwork L-system models that simulate patterns described by Lück and Lück [11]. The advantage of these models over their predecessors is that, through the use of a geometric作者: 協(xié)迫 時間: 2025-3-27 09:42 作者: 壓倒性勝利 時間: 2025-3-27 14:47
Splines Computation by Subdivision,how that for each fixed .≥1, the class of graphs allowing such routing schemes is closed under minor-taking in the domain of connected graphs, and hence has a linear time recognition algorithm. This result connects the theory of compact routing with the theory of graph minors and treewidth..We also 作者: 實施生效 時間: 2025-3-27 20:28 作者: 裂縫 時間: 2025-3-27 23:54
Hydro-Acoustic Target Detection,s are always moving..A probabilistic hot-potato routing protocol is presented that routes random functions on the (.)-torus. If at most d/88 .. packets, evenly distributed among the processors, have to be routed, they all have reached their destinations in .+.(..log .) steps, with high probability, 作者: 糾纏,纏繞 時間: 2025-3-28 02:10 作者: Diverticulitis 時間: 2025-3-28 07:09
Challenges and Research Directions,s paper, we study the problem of implementing multicasts via a technique called Unicast-Based Multicast (UBM). In particular, we focus on the problem of finding optimal UBM calling schedules for . topologies using restricted . routing schemes (a natural class of restricted routing schemes which incl作者: Root494 時間: 2025-3-28 12:15 作者: 字形刻痕 時間: 2025-3-28 18:01
Toward a general theory of unicast-based multicast communication, than implementing UBM in arbitrary topologies with free routing schemes. We then develop the Smart Centroid Algorithm, a polynomial time approximation algorithm which produces UBM calling schedules that are at most four times as long as the optimal UBM calling schedule for arbitrary topologies usin作者: Forehead-Lift 時間: 2025-3-28 20:26
Non-oblivious local search for graph and hypergraph coloring problems,作者: committed 時間: 2025-3-29 02:18 作者: Handedness 時間: 2025-3-29 04:44
Challenges and Research Directions, than implementing UBM in arbitrary topologies with free routing schemes. We then develop the Smart Centroid Algorithm, a polynomial time approximation algorithm which produces UBM calling schedules that are at most four times as long as the optimal UBM calling schedule for arbitrary topologies usin作者: Metamorphosis 時間: 2025-3-29 08:26
Darstellung und Diskussion der Ergebnisse,s of entity and relationship types in valid databases. We develop algorithms for this purpose and a number of variations of the problem, namely to construct databases of minimum size and linear ternary databases.作者: 屈尊 時間: 2025-3-29 14:46
Splines Computation by Subdivision,s a consequence, graphs that allow .-label Interval Routing Schemes under dynamic cost edges have treewidth at most 4k, and treewidth at most 2k+3 if they are planar..Similar results are shown for other types of Interval Routing Schemes.作者: 物種起源 時間: 2025-3-29 17:22
Local Splines on Non-uniform Grid,erant routings on a .-dimensional generalized .-hypercube . such that the diameter of the surviving route graph is bounded by constant for the case that the number of faults exceeds the connectivity of ..作者: ingenue 時間: 2025-3-29 21:24 作者: mitten 時間: 2025-3-30 00:29
On Interval Routing Schemes and treewidth,s a consequence, graphs that allow .-label Interval Routing Schemes under dynamic cost edges have treewidth at most 4k, and treewidth at most 2k+3 if they are planar..Similar results are shown for other types of Interval Routing Schemes.作者: 坦白 時間: 2025-3-30 06:51 作者: Compassionate 時間: 2025-3-30 10:26
Zusammenfassung der Ergebnisse,termine the extremal graphs . with the minimum number of edges such that VCp(.)≥.. Finally, we show a close relation between the VC-dimension of set systems induced by connected sets of vertices and the VC dimension of set systems induced by connected sets of edges; the argument is done via the line graph of the corresponding graph.作者: Peristalsis 時間: 2025-3-30 13:30 作者: BRUNT 時間: 2025-3-30 17:11
VC-dimensions for graphs (extended abstract),termine the extremal graphs . with the minimum number of edges such that VCp(.)≥.. Finally, we show a close relation between the VC-dimension of set systems induced by connected sets of vertices and the VC dimension of set systems induced by connected sets of edges; the argument is done via the line graph of the corresponding graph.作者: Schlemms-Canal 時間: 2025-3-30 21:16
Finding and counting small induced subgraphs efficiently,at . the number of ..‘s in a graph can be done within the same time bound ...Using the result on the ..‘s we can count the number of occurences as induced subgraph of any other fixed connected graph on four vertices within .(..+e.).作者: 受人支配 時間: 2025-3-31 04:44 作者: 專心 時間: 2025-3-31 08:51
On devising Boolean Routing schemes,also shown that the model deals efficiently with graphs resulting from applying some types of graph compositions, thus resulting in very efficient routing schemes for some classes of networks with regular topology. This is done by considering different significant cost measures of the space efficiency of the schemes considered.作者: 貴族 時間: 2025-3-31 10:19
On the isomorphism of graphs with few P4s,rnal nodes correspond to three types of graph operations and the leaves are basic graphs with a simple structure. The paper extends and generalizes results on cographs, ..-reducible graphs, and ..-sparse graphs.作者: 商業(yè)上 時間: 2025-3-31 15:51
Planarization of graphs embedded on surfaces,re obtained for planarizing vertex sets and for graphs embedded on nonorientable surfaces. Planarizing edge and vertex sets can be found in . time, if an embedding of . on a surface of genus . is given. We also construct an approximation algorithm that finds an . planarizing vertex set of . in . time if no genus-. embedding is given as an input.作者: amyloid 時間: 2025-3-31 20:11 作者: 臨時抱佛腳 時間: 2025-4-1 00:10
Visualizing two- and three-dimensional models of meristematic growth, that simulate patterns described by Lück and Lück [11]. The advantage of these models over their predecessors is that, through the use of a geometric model to determine cell shape, they can be translated into a visual form quite easily in order to animate (and validate) the growth of the meristem.作者: ALB 時間: 2025-4-1 02:13 作者: 跳脫衣舞的人 時間: 2025-4-1 06:29
