書目名稱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é)科排名
作者: GORGE 時間: 2025-3-21 22:04
Efficient Communication in Unknown Networks,ng in time (2+∈)., for any fixed positive constant ε and sufficiently large .. Thus for both BB and ABB our algorithms are close to optimal. Finally, we show a simple algorithm for FS working in time 3..The optimal time of full synchronization remains an open problem.作者: 突襲 時間: 2025-3-22 00:52 作者: Digitalis 時間: 2025-3-22 07:32 作者: 玩笑 時間: 2025-3-22 09:16 作者: Multiple 時間: 2025-3-22 15:27
https://doi.org/10.1007/978-3-642-69580-3ng in time (2+∈)., for any fixed positive constant ε and sufficiently large .. Thus for both BB and ABB our algorithms are close to optimal. Finally, we show a simple algorithm for FS working in time 3..The optimal time of full synchronization remains an open problem.作者: Multiple 時間: 2025-3-22 20:08 作者: GREG 時間: 2025-3-22 21:59
https://doi.org/10.1007/978-2-8178-0761-4each of them a route from source to destination, a starting time and a wavelength, with restrictions on the number of available wavelengths. The goal is minimizing the overall time needed to serve all requests. We study the relationship between this problem and minimum path coloring and we show how 作者: Myocyte 時間: 2025-3-23 03:57 作者: forestry 時間: 2025-3-23 09:04 作者: locus-ceruleus 時間: 2025-3-23 12:20
Petro E. Petrides,Heike L. Pahlms. First, we present a unifying framework for proving lower bounds on the space complexity, which captures most of the bounds known in the literature for relevant CDAGs, previously proved through . arguments. Then, we expose a close relationship between the notions of space and access complexity, w作者: cyanosis 時間: 2025-3-23 17:08 作者: 糾纏 時間: 2025-3-23 18:22 作者: 圓柱 時間: 2025-3-23 22:44 作者: Rinne-Test 時間: 2025-3-24 05:25
Molecular Basis of Lymphokine Actionvertices. We propose efficient algorithms solving the dispersion problem in interval graphs, circular-arc graphs, and trapezoid graphs. Graphs are supposed to be represented geometrically, rather than by their edge sets.作者: 一起平行 時間: 2025-3-24 08:27 作者: diathermy 時間: 2025-3-24 12:50
https://doi.org/10.1007/978-94-011-3114-8 and game-theoretic terminology as an underlying structure. For these networks we exhibit a simple routing procedure to update information throughout the nodes of the network. We also introduce an hierarchy for the class of all update networks and discuss the complexity of some natural problems.作者: 語言學(xué) 時間: 2025-3-24 16:01 作者: Nonflammable 時間: 2025-3-24 20:24 作者: maudtin 時間: 2025-3-25 02:23 作者: ACE-inhibitor 時間: 2025-3-25 04:46 作者: AVERT 時間: 2025-3-25 08:43
Traversing Directed Eulerian Mazes (Extended Abstract),te-state automaton. Each of the algorithms puts one pebble in one of the exits of every vertex. These pebbles indicate an Eulerian cycle of the maze. The simple algorithm performs O(|V|·|E|) edge traversals, while the advanced one traverses every edge three times. Both algorithms use memory of size 作者: Peculate 時間: 2025-3-25 11:46
On the Space and Access Complexity of Computation DAGs,ms. First, we present a unifying framework for proving lower bounds on the space complexity, which captures most of the bounds known in the literature for relevant CDAGs, previously proved through . arguments. Then, we expose a close relationship between the notions of space and access complexity, w作者: Armory 時間: 2025-3-25 16:31
Split-Perfect Graphs: Characterizations and Algorithmic Use, induce a P. in H.We call a graph . if it is P.-isomorphic to a split graph (i.e. a graph being partitionable into a clique and a stable set). This paper characterizes the new class of split-perfect graphs using the concepts of homogeneous sets and p-connected graphs, and leads to a linear time reco作者: Processes 時間: 2025-3-25 22:52 作者: 卜聞 時間: 2025-3-26 00:16
Networks with Small Stretch Number (Extended Abstract), graph in BID(.) can be characterized as follows: if some nodes have failed, as long as two nodes remain connected, the distance between these nodes in the faulty graph is at most . times the distance in the non-faulty graph. The smallest . such that . ∈ BID(.) is called . of .. In this paper we giv作者: Acquired 時間: 2025-3-26 04:33
Efficient Dispersion Algorithms for Geometric Intersection Graphs,vertices. We propose efficient algorithms solving the dispersion problem in interval graphs, circular-arc graphs, and trapezoid graphs. Graphs are supposed to be represented geometrically, rather than by their edge sets.作者: Gudgeon 時間: 2025-3-26 10:03
Optimizing Cost Flows by Modifying Arc Costs and Capacities,sed either to decrease the arc flow cost, or to increase the arc capacity, or both. The goal is to maximize the flow through the network while not exceeding bounds on the budget and on the total flow cost..The problems are NP-hard even on series-parallel graphs. We provide an approximation algorithm作者: 拾落穗 時間: 2025-3-26 12:44
Update Networks and Their Routing Strategies, and game-theoretic terminology as an underlying structure. For these networks we exhibit a simple routing procedure to update information throughout the nodes of the network. We also introduce an hierarchy for the class of all update networks and discuss the complexity of some natural problems.作者: engagement 時間: 2025-3-26 20:41 作者: Lice692 時間: 2025-3-26 21:23
Molecular Basis of Breast Cancerte-state automaton. Each of the algorithms puts one pebble in one of the exits of every vertex. These pebbles indicate an Eulerian cycle of the maze. The simple algorithm performs O(|V|·|E|) edge traversals, while the advanced one traverses every edge three times. Both algorithms use memory of size O(log d. in every vertex ..作者: 一起 時間: 2025-3-27 02:55 作者: Paradox 時間: 2025-3-27 06:43 作者: Madrigal 時間: 2025-3-27 11:18
Traversing Directed Eulerian Mazes (Extended Abstract),te-state automaton. Each of the algorithms puts one pebble in one of the exits of every vertex. These pebbles indicate an Eulerian cycle of the maze. The simple algorithm performs O(|V|·|E|) edge traversals, while the advanced one traverses every edge three times. Both algorithms use memory of size O(log d. in every vertex ..作者: 白楊魚 時間: 2025-3-27 14:58
Efficient Dispersion Algorithms for Geometric Intersection Graphs,vertices. We propose efficient algorithms solving the dispersion problem in interval graphs, circular-arc graphs, and trapezoid graphs. Graphs are supposed to be represented geometrically, rather than by their edge sets.作者: 左右連貫 時間: 2025-3-27 21:15
Update Networks and Their Routing Strategies, and game-theoretic terminology as an underlying structure. For these networks we exhibit a simple routing procedure to update information throughout the nodes of the network. We also introduce an hierarchy for the class of all update networks and discuss the complexity of some natural problems.作者: LANCE 時間: 2025-3-27 23:49
Graph-Theoretic Concepts in Computer Science978-3-540-40064-6Series ISSN 0302-9743 Series E-ISSN 1611-3349 作者: Forehead-Lift 時間: 2025-3-28 03:19
Syed Ibrahim Rizvi,Ufuk ?akatayWe are given . points in the plane and a vertical line ? (directed upwards) that intersects the convex hull, conv., of .. We want to find ‘ways’ to the first edge (facet) of conv. met by line ?.作者: 伴隨而來 時間: 2025-3-28 07:33 作者: 男學(xué)院 時間: 2025-3-28 14:22 作者: 注意 時間: 2025-3-28 15:19 作者: Nucleate 時間: 2025-3-28 22:21
Bretislav Friedrich,Horst Schmidt-B?ckingWe present the first efficient algorithm for a coarse grained multiprocessor that colors a graph . with a guarantee of at most Δ.+1 colors.作者: Outwit 時間: 2025-3-29 01:45 作者: Water-Brash 時間: 2025-3-29 06:07
Approximating the Treewidth of AT-Free Graphs,Using the specific structure of the minimal separators of AT-free graphs, we give a polynomial time algorithm that computes a triangulation whose width is no more than twice the treewidth of the input graph.作者: 不要不誠實 時間: 2025-3-29 08:12
,Diameter of the Kn?del Graph,Diameter of the 2.-node Kn?del graph is [(. + 2)/2].作者: 抗體 時間: 2025-3-29 14:32
On the Domination Search Number,We introduce the domination search game which can be seen as a natural modification of the well-known node search game. Various results concerning the domination search number of a graph are presented.作者: 商議 時間: 2025-3-29 17:00
Graph Coloring on a Coarse Grained Multiprocessor (Extended Abstract),We present the first efficient algorithm for a coarse grained multiprocessor that colors a graph . with a guarantee of at most Δ.+1 colors.作者: 皺痕 時間: 2025-3-29 21:48 作者: BRACE 時間: 2025-3-30 02:38 作者: 虛度 時間: 2025-3-30 07:49
https://doi.org/10.1007/978-1-4419-1513-9ur new bounds are tight up to a constant factor. As a by-product, we derive new lower bounds for the bisection widths of 3- and 4-regular graphs. We use them to establish tighter lower bounds for the bisection width of 3- and 4-regular Ramanujan graphs.作者: 粗糙 時間: 2025-3-30 08:19
Molecular Basis of Hematopoiesisen graphs, and (7,3)-graphs. Moreover, split-perfect graphs form a new subclass of brittle graphs containing the superbrittle graphs for which a new characterization is obtained leading to linear time recognition.作者: 車床 時間: 2025-3-30 12:40
On the Expected Runtime and the Success Probability of Evolutionary Algorithms (Invited Presentatioues are necessary. Two such results are presented. First, it is shown that the most simple evolutionary algorithm optimizes each pseudo-boolean linear function in an expected time of O(. log .). Second, an example is shown where crossover decreases the expected runtime from superpolynomial to polynomial.作者: 抗體 時間: 2025-3-30 18:13
Approximating Call-Scheduling Makespan in All-Optical Networks,s of rings. As a side result, we present a constant approximation algorithm for star networks. We assume for simplicity that all calls are released at time 0, however all our results hold also for arbitrary release dates at the expense of a factor 2 in the approximation ratio.作者: 露天歷史劇 時間: 2025-3-30 22:37 作者: lethal 時間: 2025-3-31 02:25
Split-Perfect Graphs: Characterizations and Algorithmic Use,en graphs, and (7,3)-graphs. Moreover, split-perfect graphs form a new subclass of brittle graphs containing the superbrittle graphs for which a new characterization is obtained leading to linear time recognition.作者: 使混合 時間: 2025-3-31 06:32 作者: 陳腐的人 時間: 2025-3-31 11:17
Angelo Azzi,Zdenek Drahota,Sergio Papa on series-parallel graphs which, for arbitrary δ,ε > 0, produces a solution which exceeds the bounds on the budget and the flow cost by factors 1+δ and 1+ε, respectively, while the amount of flow is at least that of an optimum solution. The running time of the algorithm is polynomial in the input size and 1/(δε).作者: 消耗 時間: 2025-3-31 16:38
Optimizing Cost Flows by Modifying Arc Costs and Capacities, on series-parallel graphs which, for arbitrary δ,ε > 0, produces a solution which exceeds the bounds on the budget and the flow cost by factors 1+δ and 1+ε, respectively, while the amount of flow is at least that of an optimum solution. The running time of the algorithm is polynomial in the input size and 1/(δε).作者: Atrium 時間: 2025-3-31 19:47
