書(shū)目名稱Graph-Theoretic Concepts in Computer Science影響因子(影響力)學(xué)科排名
書(shū)目名稱Graph-Theoretic Concepts in Computer Science網(wǎng)絡(luò)公開(kāi)度
書(shū)目名稱Graph-Theoretic Concepts in Computer Science網(wǎng)絡(luò)公開(kāi)度學(xué)科排名
書(shū)目名稱Graph-Theoretic Concepts in Computer Science被引頻次
書(shū)目名稱Graph-Theoretic Concepts in Computer Science被引頻次學(xué)科排名
書(shū)目名稱Graph-Theoretic Concepts in Computer Science年度引用
書(shū)目名稱Graph-Theoretic Concepts in Computer Science年度引用學(xué)科排名
書(shū)目名稱Graph-Theoretic Concepts in Computer Science讀者反饋
書(shū)目名稱Graph-Theoretic Concepts in Computer Science讀者反饋學(xué)科排名
作者: 要素 時(shí)間: 2025-3-21 23:41
Scheduling with incompatible jobs,proximation algorithms for this problem where the job incompatibilities possess a special structure. As the incompatibilities form a graph on the set of jobs, our algorithms strongly rely on graph theoretic methods. We also solve an open problem by Biró, Hujter and Tuza on coloring precolored bipartite graphs.作者: Self-Help-Group 時(shí)間: 2025-3-22 03:22
Generalized coloring for tree-like graphs,inear time. In contrast to that, . and . differ in complexity for cographs. While the first has a linear algorithm, the second is shown NP-complete. We give polynomial algorithms for the corresponding enumeration problems #. and #. on partial k-trees and trees and for #. on cographs.作者: 弓箭 時(shí)間: 2025-3-22 04:33
Minimum rectilinear steiner trees for intervals on two parallel lines,ws that . (.) is NP-hard, even if each class consists of at most three single points. But we give an exact algorithm that has linear time complexity, if roughly spoken for no vertical line more than a constant number of classes contain points on the right and also not on the right side of this line.作者: encomiast 時(shí)間: 2025-3-22 10:13
https://doi.org/10.1007/978-3-322-86871-8mparability graphs and in O(n.) time on cographs. For general graphs, the problem is known to be PSPACE-complete, but can be solved in time, polynomial in the number of isolatable sets of vertices of the graph.作者: Annotate 時(shí)間: 2025-3-22 15:12
,Kayles on special classes of graphs — An application of Sprague-Grundy theory,mparability graphs and in O(n.) time on cographs. For general graphs, the problem is known to be PSPACE-complete, but can be solved in time, polynomial in the number of isolatable sets of vertices of the graph.作者: Annotate 時(shí)間: 2025-3-22 17:39 作者: Clinch 時(shí)間: 2025-3-22 21:45
https://doi.org/10.1007/978-3-8349-3671-4proximation algorithms for this problem where the job incompatibilities possess a special structure. As the incompatibilities form a graph on the set of jobs, our algorithms strongly rely on graph theoretic methods. We also solve an open problem by Biró, Hujter and Tuza on coloring precolored bipartite graphs.作者: separate 時(shí)間: 2025-3-23 05:04
https://doi.org/10.1007/978-3-658-10317-0inear time. In contrast to that, . and . differ in complexity for cographs. While the first has a linear algorithm, the second is shown NP-complete. We give polynomial algorithms for the corresponding enumeration problems #. and #. on partial k-trees and trees and for #. on cographs.作者: convert 時(shí)間: 2025-3-23 06:41 作者: 影響 時(shí)間: 2025-3-23 13:04
https://doi.org/10.1007/978-3-322-90696-0nt to the system of 2-cuts of .. For 3-cuts and .. of a 3-edge-connected graph we follow [DKL76]. The space complexity of the description suggested is . (though the total number of 3-cuts may be a cubic function of .).作者: meditation 時(shí)間: 2025-3-23 17:34 作者: Palliation 時(shí)間: 2025-3-23 20:12 作者: Reservation 時(shí)間: 2025-3-24 02:03
Embeddings in recursive combinatorial networks, isomorphic, embedded full binary trees (FBT‘s) in RCN‘s with expansion of two. A routing scheme is designed which resolves the root congestion problem in such binary trees. Finally, an .× . mesh is embedded in RCN‘s with dilation of one and expansion of 2.., where 2. < . ≤ 2. for . ≥ 2.作者: 談判 時(shí)間: 2025-3-24 05:42
https://doi.org/10.1007/978-3-322-93297-6er of processors used). The results of this kind are generalized in a trade-off among time, number of processors, separator of the network and the communication complexity of the problem computed. These results are extended also for a probabilistic model of parallel networks.作者: rectum 時(shí)間: 2025-3-24 09:15 作者: CLAN 時(shí)間: 2025-3-24 12:10 作者: GEON 時(shí)間: 2025-3-24 16:51
Topology of parallel networks and computational complexity (extended abstract),er of processors used). The results of this kind are generalized in a trade-off among time, number of processors, separator of the network and the communication complexity of the problem computed. These results are extended also for a probabilistic model of parallel networks.作者: Ccu106 時(shí)間: 2025-3-24 21:06 作者: 向下 時(shí)間: 2025-3-25 00:19
A new characterization of tree medians with applications to distributed algorithms,oosing a median and then routing all the information through it is the best possible strategy, in terms of worst-case number of messages sent during any execution of any distributed sorting algorithm. We also discuss the implications for networks of a general topology and for the distributed ranking problem.作者: 諄諄教誨 時(shí)間: 2025-3-25 06:40 作者: 把…比做 時(shí)間: 2025-3-25 07:49 作者: 誘惑 時(shí)間: 2025-3-25 14:05
Modernes Marketing — Moderner Handelnsion at most 2. As consequences we are able to give obstructions for the class of bounded tolerance graphs and to give an example of a graph which is alternatingly orientable but not a tolerance graph. We also characterize the tolerance graphs among the complements of trees作者: Largess 時(shí)間: 2025-3-25 15:53
https://doi.org/10.1007/978-3-322-84636-5mplete even for interval orders. If each job has a specified type and processors can only execute jobs with one type, the problem can be solved in polynomial time. The same holds if the deadline is constant. At last we give a heuristic for the scheduling problem restricted to an interval order with 作者: 聽(tīng)覺(jué) 時(shí)間: 2025-3-25 23:22 作者: 鎮(zhèn)痛劑 時(shí)間: 2025-3-26 01:18
https://doi.org/10.1007/978-3-658-10317-0artial k-trees are solved in linear time, when the number of colors is a constant and by O(|V|.)-algorithmsin general. For trees, we improve this to linear time. In contrast to that, . and . differ in complexity for cographs. While the first has a linear algorithm, the second is shown NP-complete. W作者: Rustproof 時(shí)間: 2025-3-26 07:00
https://doi.org/10.1007/978-3-322-93297-6tance, some one-output Boolean function . (corresponding to a deterministic context-free language) requiring exponential number of processors to be computed in polylogarithmic time by unbounded-degree networks with polylogarithmic separators (for instance, trees) is presented. If one restricts the c作者: 名次后綴 時(shí)間: 2025-3-26 11:34 作者: 發(fā)誓放棄 時(shí)間: 2025-3-26 16:21
https://doi.org/10.1007/978-3-322-89476-2es an initial effort at combining topological invariants with combinatorial analysis to design efficient graph isomorphism algorithms. In particular, a linear time algorithm for isomorphism of graphs of bounded average genus is presented.作者: 古文字學(xué) 時(shí)間: 2025-3-26 17:59 作者: 小溪 時(shí)間: 2025-3-27 00:16 作者: 口音在加重 時(shí)間: 2025-3-27 05:05 作者: 愛(ài)花花兒憤怒 時(shí)間: 2025-3-27 05:46 作者: 慌張 時(shí)間: 2025-3-27 10:25
Modernes Sourcing in der Automobilindustriery graphs: the leaves of this tree are the p-connected components along with weak vertices, that is, vertices of the graph that belong to no p-connected component. By refining this first result, we obtain a new decomposition for arbitrary graphs that generalizes the well-known modular decomposition.作者: Grandstand 時(shí)間: 2025-3-27 14:08
https://doi.org/10.1007/978-3-322-84124-7m combinatorial principles, we have recently designed a new family of labeled networks, called . (RCN‘s). These bipartite networks are recursive in nature with incrementability of one and succinctly representable. They have low diameter (equal to three), good fault-tolerance, and high degree of symm作者: 舔食 時(shí)間: 2025-3-27 19:59 作者: 不法行為 時(shí)間: 2025-3-28 00:47 作者: 合適 時(shí)間: 2025-3-28 02:30 作者: 真實(shí)的你 時(shí)間: 2025-3-28 06:28 作者: 任意 時(shí)間: 2025-3-28 11:21
Scheduling with incompatible jobs,consider the problem to minimize the maximum job completion time, the makespan. This problem is NP-complete..We present a number of polynomial time approximation algorithms for this problem where the job incompatibilities possess a special structure. As the incompatibilities form a graph on the set 作者: plasma 時(shí)間: 2025-3-28 17:48
Generalized coloring for tree-like graphs,artial k-trees are solved in linear time, when the number of colors is a constant and by O(|V|.)-algorithmsin general. For trees, we improve this to linear time. In contrast to that, . and . differ in complexity for cographs. While the first has a linear algorithm, the second is shown NP-complete. W作者: amphibian 時(shí)間: 2025-3-28 21:57 作者: 兵團(tuán) 時(shí)間: 2025-3-29 00:26
,Kayles on special classes of graphs — An application of Sprague-Grundy theory,iven graph. The last player that choses a vertex wins the game. We show, with help of Sprague-Grundy theory, that the problem to determine which player has a winning strategy for a given graph, can be solved in O(n. time on interval graphs, on circular arc graphs, on permutation graphs, and on co-co作者: GNAT 時(shí)間: 2025-3-29 03:16 作者: 逢迎春日 時(shí)間: 2025-3-29 08:02
Improved algorithms for routing on two-dimensional grids,e wires. We pay particular attention to routing problems where each wire connects terminals that are distance at most . apart in the grid and where each wire is allowed to have at most . bends. (Typically, . and . are small constants, but they can also represent arbitrary functions of .). Among othe作者: Adj異類的 時(shí)間: 2025-3-29 14:42 作者: 侵蝕 時(shí)間: 2025-3-29 18:54 作者: 暖昧關(guān)系 時(shí)間: 2025-3-29 22:41 作者: Osmosis 時(shí)間: 2025-3-30 03:01
On the homogeneous decomposition of graphs,ry graphs: the leaves of this tree are the p-connected components along with weak vertices, that is, vertices of the graph that belong to no p-connected component. By refining this first result, we obtain a new decomposition for arbitrary graphs that generalizes the well-known modular decomposition.作者: 外向者 時(shí)間: 2025-3-30 05:04 作者: 表兩個(gè) 時(shí)間: 2025-3-30 09:09 作者: helper-T-cells 時(shí)間: 2025-3-30 13:35
https://doi.org/10.1007/978-3-322-85971-6A new parallel algorithm for the triangulation of a nonconvex polytope . is presented. It will be shown that . can be decomposed into O(n+r.) tetrahedra within time O(log(.) · (max{log*(.),log(.)}) with O(n+r.) processors, where . denotes the number of reflex edges of ..作者: 翻動(dòng) 時(shí)間: 2025-3-30 19:56
https://doi.org/10.1007/978-3-322-96867-8A set of operations on 4-connected graphs is introduced in which only line addition and vertex splitting are involved. It is shown that every 4-connected graph can be assembled from either the complete graph .. or the double-axle wheel .. on four vertices using only these operations, with 4-connectivity preserved.作者: 不斷的變動(dòng) 時(shí)間: 2025-3-30 22:11
https://doi.org/10.1007/978-3-662-04882-5A conjecture about digraphs is presented. The conjecture has relevance to parallel computing, and is supported by a few concrete results.作者: 窒息 時(shí)間: 2025-3-31 02:38 作者: fastness 時(shí)間: 2025-3-31 06:08
Parallel triangulation of nonconvex polytopes,A new parallel algorithm for the triangulation of a nonconvex polytope . is presented. It will be shown that . can be decomposed into O(n+r.) tetrahedra within time O(log(.) · (max{log*(.),log(.)}) with O(n+r.) processors, where . denotes the number of reflex edges of ..作者: uncertain 時(shí)間: 2025-3-31 13:12 作者: 柏樹(shù) 時(shí)間: 2025-3-31 15:33 作者: insurgent 時(shí)間: 2025-3-31 18:48 作者: 得意牛 時(shí)間: 2025-4-1 00:21 作者: 陶醉 時(shí)間: 2025-4-1 04:06 作者: Hot-Flash 時(shí)間: 2025-4-1 06:35 作者: 油膏 時(shí)間: 2025-4-1 11:18
Modernes Sourcing in der Automobilindustriery graphs: the leaves of this tree are the p-connected components along with weak vertices, that is, vertices of the graph that belong to no p-connected component. By refining this first result, we obtain a new decomposition for arbitrary graphs that generalizes the well-known modular decomposition. ...作者: Ballad 時(shí)間: 2025-4-1 15:37 作者: outrage 時(shí)間: 2025-4-1 18:55 作者: 離開(kāi) 時(shí)間: 2025-4-1 22:49
