書(shū)目名稱(chēng)Graph-Theoretic Concepts in Computer Science影響因子(影響力)學(xué)科排名
書(shū)目名稱(chēng)Graph-Theoretic Concepts in Computer Science網(wǎng)絡(luò)公開(kāi)度
書(shū)目名稱(chēng)Graph-Theoretic Concepts in Computer Science網(wǎng)絡(luò)公開(kāi)度學(xué)科排名
書(shū)目名稱(chēng)Graph-Theoretic Concepts in Computer Science被引頻次
書(shū)目名稱(chēng)Graph-Theoretic Concepts in Computer Science被引頻次學(xué)科排名
書(shū)目名稱(chēng)Graph-Theoretic Concepts in Computer Science年度引用
書(shū)目名稱(chēng)Graph-Theoretic Concepts in Computer Science年度引用學(xué)科排名
書(shū)目名稱(chēng)Graph-Theoretic Concepts in Computer Science讀者反饋
書(shū)目名稱(chēng)Graph-Theoretic Concepts in Computer Science讀者反饋學(xué)科排名
作者: NEG 時(shí)間: 2025-3-21 21:45
https://doi.org/10.1007/978-1-4684-7838-9aphs) which are Minimum Broadcast Graphs, Minimum Gossip Graphs, Minimum Linear Gossip Graphs and/or Minimum Broadcast Digraphs, and we show that in most cases, the proposed minimum graphs that can be found in the literature are Kn?del graphs [10,7].作者: 交響樂(lè) 時(shí)間: 2025-3-22 01:17 作者: 結(jié)束 時(shí)間: 2025-3-22 06:48 作者: 廚師 時(shí)間: 2025-3-22 12:23 作者: 惹人反感 時(shí)間: 2025-3-22 16:17
Compact Implicit Representation of Graphs,el per vertex and constant time adjacency test, and .(.(.)log .) bit label per vertex and .(log. (.)) steps to test adjacency, respectively. Additionally, the labeling schema is ., that is: no pointers are used.作者: 惹人反感 時(shí)間: 2025-3-22 17:51 作者: Instantaneous 時(shí)間: 2025-3-23 00:21 作者: 使困惑 時(shí)間: 2025-3-23 04:21
https://doi.org/10.1007/978-94-010-1161-7ver problem asks for the existence of a . triangle packing in a graph .. It is known that the triangle cover problem is NP-complete on general graphs with clique number 3 [6]. The VDT problem is MAX SNP-hard on graphs with maximum degree four, while it can be approximated within 3/2+., for any . > 0作者: overbearing 時(shí)間: 2025-3-23 07:00 作者: CLOT 時(shí)間: 2025-3-23 10:13
https://doi.org/10.1007/978-1-4612-2946-9ithm with message complexity 1.43 .+.(.+.) and prove the lower bound in the form 1.14 . – .(1). This is an improvement over the previous . upper bound and . lower bound achieved by Diks, Kranakis and Pelc [DKP96]. Unlike the algorithm from [DKP96], our algorithm works also on non-square tori, does n作者: 推遲 時(shí)間: 2025-3-23 16:41 作者: intoxicate 時(shí)間: 2025-3-23 20:24 作者: obstruct 時(shí)間: 2025-3-24 01:08 作者: ALE 時(shí)間: 2025-3-24 02:41 作者: 神刊 時(shí)間: 2025-3-24 07:13
Modern X86 Assembly Language Programming a vertex of larger color. We consider the directed variant of this problem, where the above condition is imposed only on those paths in which all edges are oriented in the same direction. We show that the ranking number of a directed tree is bounded by that of its longest directed path plus one, an作者: machination 時(shí)間: 2025-3-24 10:48 作者: 宇宙你 時(shí)間: 2025-3-24 16:54 作者: Gratulate 時(shí)間: 2025-3-24 19:33 作者: 多產(chǎn)子 時(shí)間: 2025-3-25 02:59 作者: Decongestant 時(shí)間: 2025-3-25 06:19 作者: ASTER 時(shí)間: 2025-3-25 08:42
https://doi.org/10.1007/978-3-642-93727-9e the diameter problem on chordal and AT-free graphs and show that a very simple (linear time) 2-sweep Lex-BFS algorithm identifies a vertex of maximum eccentricity unless the given graph has a specified induced subgraph (it was previously known that a single Lex-BFS algorithm is guaranteed to end a作者: Protein 時(shí)間: 2025-3-25 15:14
Moderne Arbeitsmethoden im Maschinenbaus their distance in .. In this paper, we incorporate a concept of fault-tolerance by examining .. Given a root vertex ., this is a pair of tree .-spanners, such that the two paths from any vertex to . are edge (resp., internally vertex) disjoint. It is shown that a pair of independent tree 2-spanner作者: 美麗的寫(xiě) 時(shí)間: 2025-3-25 18:42
https://doi.org/10.1007/978-3-642-98973-5emanating from .. The goal is to find a minimum cost set of nodes to be upgraded so that the resulting network has a good performance. The performance is measured by the bottleneck weight of a constrained forest defined by a proper function [GW95]. These problems are a generalization of the node wei作者: Handedness 時(shí)間: 2025-3-25 22:45
https://doi.org/10.1007/978-3-322-93575-5his paper we give the exact value of the edge forwarding index and bisection width of the generalize recursive circulant graphs .(..,.) with . > . > 0. Moreover we prove that they admit a Hamiltonian decomposition.作者: AVOID 時(shí)間: 2025-3-26 02:57 作者: Harbor 時(shí)間: 2025-3-26 04:30 作者: Minuet 時(shí)間: 2025-3-26 09:59 作者: 震驚 時(shí)間: 2025-3-26 12:53
Communication in the Two-Way Listen-in Vertex-Disjoint Paths Mode, investigated. In this communication mode, in one communication step two processors communicating via a path . send their pieces of information to all other processors on this path, too. The complexity of a communication algorithm is measured by the number of communication steps (rounds)..The main r作者: blackout 時(shí)間: 2025-3-26 18:07
Broadcasting on Anonymous Unoriented Tori,ithm with message complexity 1.43 .+.(.+.) and prove the lower bound in the form 1.14 . – .(1). This is an improvement over the previous . upper bound and . lower bound achieved by Diks, Kranakis and Pelc [DKP96]. Unlike the algorithm from [DKP96], our algorithm works also on non-square tori, does n作者: absolve 時(shí)間: 2025-3-26 23:20
Families of Graphs Having Broadcasting and Gossiping Properties,broadcasting (resp. gossiping), one node (resp. every node) has a piece of information and needs to transmit it to everyone else in the network. These communications patterns find their main applications in the field of interconnection networks for parallel architectures. In this paper, we are inter作者: Parallel 時(shí)間: 2025-3-27 05:06 作者: Detonate 時(shí)間: 2025-3-27 05:34
A Generalization of AT-free Graphs and a Generic Algorithm for Solving Treewidth, Minimum Fill-In ardinality three is called . and graphs without an asteroidal triple are called .. The maximum cardinality of an asteroidal set of ., denoted by .(.), is said to be the . of .. We present a scheme for designing algorithms for triangulation problems on graphs. As a consequence, we obtain algorithms to作者: 考古學(xué) 時(shí)間: 2025-3-27 12:36
A Polynomial-Time Algorithm for Finding Total Colorings of Partial ,-Trees,eive the same color. Many combinatorial problems can be efficiently solved for partial .-trees (graphs of treewidth bounded by a constant .). However, no polynomial-time algorithm has been known for the problem of finding a total coloring of a given partial .-tree with the minimum number of colors. 作者: 小溪 時(shí)間: 2025-3-27 15:01
Rankings of Directed Graphs, a vertex of larger color. We consider the directed variant of this problem, where the above condition is imposed only on those paths in which all edges are oriented in the same direction. We show that the ranking number of a directed tree is bounded by that of its longest directed path plus one, an作者: Injunction 時(shí)間: 2025-3-27 17:48 作者: 有罪 時(shí)間: 2025-3-28 00:39 作者: Plaque 時(shí)間: 2025-3-28 03:50 作者: 夜晚 時(shí)間: 2025-3-28 06:18
Compact Implicit Representation of Graphs,ly all vertices and all edges. The names (labels) assigned to vertices are used only to encode the edges and betray nothing about the structure of the graph itself and hence are a “waste” of space. In this context, we present a general framework for labeling . graph so that adjacency between any two作者: 有機(jī)體 時(shí)間: 2025-3-28 14:00
Graphs with Bounded Induced Distance,des is at most . times the distance between the same nodes. In communication networks modeled by these graphs any message can be always delivered through a path whose length is at most . times the best possible one, even if some nodes fail..In this work we first provide a characterization of graphs 作者: Offstage 時(shí)間: 2025-3-28 14:48 作者: notion 時(shí)間: 2025-3-28 19:44
Independent Tree Spanners,s their distance in .. In this paper, we incorporate a concept of fault-tolerance by examining .. Given a root vertex ., this is a pair of tree .-spanners, such that the two paths from any vertex to . are edge (resp., internally vertex) disjoint. It is shown that a pair of independent tree 2-spanner作者: 消毒 時(shí)間: 2025-3-29 02:27 作者: Coterminous 時(shí)間: 2025-3-29 06:50
Routing in Recursive Circulant Graphs: Edge Forwarding Index and Hamiltonian Decomposition,his paper we give the exact value of the edge forwarding index and bisection width of the generalize recursive circulant graphs .(..,.) with . > . > 0. Moreover we prove that they admit a Hamiltonian decomposition.作者: recede 時(shí)間: 2025-3-29 08:10
https://doi.org/10.1007/978-1-4612-2946-9 and . lower bound achieved by Diks, Kranakis and Pelc [DKP96]. Unlike the algorithm from [DKP96], our algorithm works also on non-square tori, does not require the knowledge of sizes . and . and uses only messages of size .(1) bits. This is the first known broadcasting algorithm on unoriented tori that does not use all edges.作者: commune 時(shí)間: 2025-3-29 12:36 作者: ANNUL 時(shí)間: 2025-3-29 18:51 作者: 消息靈通 時(shí)間: 2025-3-29 22:11
https://doi.org/10.1007/978-3-663-20223-3 we characterize graphs in BID(2/3) by means of their minimal forbidden induced subgraphs, and we also show that graphs in BID(2) have a more complex characterization. We prove that the recognition problem for the generic class BID(.) is Co-NP-complete. Finally, we show that the split composition can be used to generate graphs in BID(.).作者: 不透明 時(shí)間: 2025-3-30 02:29
Moderne Arbeitsmethoden im Maschinenbaur .. These are tree .-root-spanners where paths from any vertex to the root have to be detour-free. In the . independent case, a pair of these can be found in linear time for all ., whereas the . independent case remains .-complete.作者: 最低點(diǎn) 時(shí)間: 2025-3-30 04:03 作者: Deference 時(shí)間: 2025-3-30 12:10
Triangles in Euclidean Arrangements,n the other hand a non-simple arrangements of . pseudolines in the Euclidean plane tan have as few as 2./3 triangles and this bound is best possible. We also discuss the maximal possible number of triangles and some extensions... 52A10, 52ClO.作者: Asseverate 時(shí)間: 2025-3-30 13:01 作者: exorbitant 時(shí)間: 2025-3-30 19:27 作者: 和諧 時(shí)間: 2025-3-30 22:10 作者: 聯(lián)想記憶 時(shí)間: 2025-3-31 03:40 作者: Figate 時(shí)間: 2025-3-31 07:28
https://doi.org/10.1007/978-1-4899-1450-7esults are optimal (or nearly optimal, up to one round) broadcast, accumulation, and gossip algorithms for paths, cycles, complete graphs, two-dimensional grids, hypercubes and hypercube-like networks.作者: incisive 時(shí)間: 2025-3-31 09:12 作者: PLE 時(shí)間: 2025-3-31 13:26
Modern X86 Assembly Language Programmingd that it can be computed in polynomial time. Unlike the undirected case, however, deciding whether the ranking number of a directed (and even of an acyclic directed) graph is bounded by a constant is NP-complete. In fact, the 3-ranking of planar bipartite acyclic digraphs is already hard.作者: FIR 時(shí)間: 2025-3-31 18:08 作者: Decline 時(shí)間: 2025-4-1 00:21 作者: 古老 時(shí)間: 2025-4-1 05:44
Minus Domination in Small-Degree Graphs, section is concerned with complexity results for Δ ≤ 4: We show that computing .. is NP-hard and MAX SNP-hard there, but that .. can be approximated in linear time within some constant factor. Finally, our approach also applies to signed domination (where the labels are -1,+1 only) in small-degree graphs.作者: 大約冬季 時(shí)間: 2025-4-1 08:48 作者: MOTIF 時(shí)間: 2025-4-1 11:46
A Generalization of AT-free Graphs and a Generic Algorithm for Solving Treewidth, Minimum Fill-In a compute graph parameters such as treewidth, minimum fill-in and vertex ranking number. The running time of these algorithms is a polynomial (of degree asteroidal number plus a small constant) in the number of vertices and the number of minimal separators of the input graph.作者: 窒息 時(shí)間: 2025-4-1 17:19
Rankings of Directed Graphs,d that it can be computed in polynomial time. Unlike the undirected case, however, deciding whether the ranking number of a directed (and even of an acyclic directed) graph is bounded by a constant is NP-complete. In fact, the 3-ranking of planar bipartite acyclic digraphs is already hard.
