書目名稱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 23:59
https://doi.org/10.1007/978-3-658-25617-3Pullback rewriting has recently been introduced as a new and unifying paradigm for vertex rewriting in graphs. In this paper we show how to extend it to describe in a uniform way more rewriting mechanisms such as node and handle rewriting in hypergraphs.作者: Halfhearted 時間: 2025-3-22 04:09
Andriy Luntovskyy,Dietbert GütterLet an edge cut partition the vertex set of the .-cube into . subsets ..,..., .. with ∥..| — |A.∥ ? 1. We consider the problem to determine minimal size of such a cut and present its asymptotic as . → ∞ and also as . → ∞ and . is a constant of the form .=2.±. with .≥.≥0.作者: 不連貫 時間: 2025-3-22 04:59
Moderne Rechnernetze – übungsbuchIn the paper we prove that, for a fixed ., the problem of deciding whether a graph admits a partition of its vertex set into .-element cliques or anticliques (i.e. independent sets) is polynomial.作者: 不能約 時間: 2025-3-22 11:19 作者: Abjure 時間: 2025-3-22 14:55 作者: Abjure 時間: 2025-3-22 21:04 作者: IST 時間: 2025-3-22 23:05
,On κ-partitioning the n-cube,Let an edge cut partition the vertex set of the .-cube into . subsets ..,..., .. with ∥..| — |A.∥ ? 1. We consider the problem to determine minimal size of such a cut and present its asymptotic as . → ∞ and also as . → ∞ and . is a constant of the form .=2.±. with .≥.≥0.作者: debouch 時間: 2025-3-23 01:56
Clique and anticlique partitions of graphs,In the paper we prove that, for a fixed ., the problem of deciding whether a graph admits a partition of its vertex set into .-element cliques or anticliques (i.e. independent sets) is polynomial.作者: TRUST 時間: 2025-3-23 08:22 作者: 騷擾 時間: 2025-3-23 12:39 作者: Slit-Lamp 時間: 2025-3-23 14:03 作者: Terminal 時間: 2025-3-23 18:50 作者: 紀(jì)念 時間: 2025-3-23 23:52 作者: 孤僻 時間: 2025-3-24 05:42
Andriy Luntovskyy,Dietbert Gütterjn graphs. The main emphasis of the embedding methods presented here is how to emulate arbitrarily large complete binary trees in these product graphs with low slowdown. For the embedding methods presented here the size of the host graph can be fixed to an arbitrary size, while we define no bound on作者: 青石板 時間: 2025-3-24 08:27 作者: STERN 時間: 2025-3-24 14:11 作者: 打折 時間: 2025-3-24 14:54 作者: 腫塊 時間: 2025-3-24 22:08
https://doi.org/10.1007/978-3-642-92071-4 the fault status of tested neighbors, while faulty testers can give arbitrary test results. Processors fail independently with constant probability .<1/2 and the goal is to identify correctly the status of all processors, based on the set of test results. We give fast diagnosis algorithms with the 作者: wangle 時間: 2025-3-25 01:54 作者: Hemiplegia 時間: 2025-3-25 05:57
Moderne Stationsorganisation im Krankenhausost . in .. In this paper we consider LexBFS-orderings of chordal, distance-hereditaxy and HHD-free graphs (the graphs where each cycle of length at least five has two chords) with respect to their powers. We show that any LexBFS-ordering of a chordal graph is a common perfect elimination ordering o作者: 領(lǐng)先 時間: 2025-3-25 08:16 作者: violate 時間: 2025-3-25 15:03
https://doi.org/10.1007/978-3-662-08807-4 problems which are important from both the theoretical and the practical point of view. Up to now, switchbox routing has been known to be solvable in polynomial time when there are only 2-terminal nets, and to be NP-complete in case there exist nets involving at least five terminals. Our main resul作者: Congeal 時間: 2025-3-25 15:56 作者: 減弱不好 時間: 2025-3-25 23:21
Hypergraphs and decision trees,e obtained by establishing connections between the decomposition problem and some extremal questions in hypergraphs..Let . ≥ 1 be integers. A . is a set .... defined by a finite set of constraints ..(.)=0, ..(.) > 0 where .., .. are polynomials of degrees not exceeding .. For any set ...., let ..(.)作者: V洗浴 時間: 2025-3-26 01:46 作者: Implicit 時間: 2025-3-26 06:56
A new characterization of ,,-connected graphs, both sets in the partition. A ..-chain is a sequence of vertices such that every four consecutive ones induce a ... The main result of this work states that a graph is ..-connected if and only if each pair of vertices is connected by a ..chain. Our proof relies, in part, on a linear-time algorithm 作者: 兇猛 時間: 2025-3-26 09:26
Embedding complete binary trees in product graphs,jn graphs. The main emphasis of the embedding methods presented here is how to emulate arbitrarily large complete binary trees in these product graphs with low slowdown. For the embedding methods presented here the size of the host graph can be fixed to an arbitrary size, while we define no bound on作者: infantile 時間: 2025-3-26 13:04 作者: 否決 時間: 2025-3-26 18:43 作者: Filibuster 時間: 2025-3-26 22:08
More general parallel tree contraction: Register allocation and broadcasting in a tree, their original framework. We discuss applications to the following problems: (1) Register allocation, i.e., computing the number of registers needed to evaluate a given expression if all intermediate results must be kept in registers; and (2) Broadcasting in a tree, i.e., computing the number of st作者: enmesh 時間: 2025-3-27 02:00 作者: AGONY 時間: 2025-3-27 08:20 作者: clarify 時間: 2025-3-27 11:40 作者: 放肆的我 時間: 2025-3-27 16:26 作者: palpitate 時間: 2025-3-27 20:26
Switchbox routing in VLSI design: Closing the complexity gap, problems which are important from both the theoretical and the practical point of view. Up to now, switchbox routing has been known to be solvable in polynomial time when there are only 2-terminal nets, and to be NP-complete in case there exist nets involving at least five terminals. Our main resul作者: 不發(fā)音 時間: 2025-3-28 01:11
Detecting diamond necklaces in labeled dags,ially ordered set of process states. The debugging of control flows (sequences of process states) of these executions is based on the satisfaction of predicates by process states. A process state that satisfies a predicate inherits its label. It follows that, in this context, a distributed execution作者: 凝視 時間: 2025-3-28 03:21 作者: 作繭自縛 時間: 2025-3-28 09:57 作者: 向外 時間: 2025-3-28 12:05
Hypergraphs and decision trees,ree for the membership question of .. must have height at least .. In this talk we discuss a recent result by Grigoriev, Karpinski and Yao [GKY], which gives an exponential lower bound to ..(..) for any fixed ., and hence to the size of any fixed degree (ternary) algebraic decision tree for solving 作者: 獸群 時間: 2025-3-28 14:55
Counting edges in a dag,nswered in constant time. The space required is ..)..We apply the proposed technique to various problems about dominance, providing the first known incremental and decrementai solutions for maintaining the ., the ., and the . of a dag.作者: MARS 時間: 2025-3-28 22:24
LexBFS-orderings and powers of graphs, forbidden isometric subgraphs for which any LexBFS-ordering of the graph is a common perfect elimination ordering of all its nontrivial powers. As an application we get a linear time approximation of the diameter for weak bipolarizable graphs, a subclass of HHD-free graphs containing all chordal gr作者: 生銹 時間: 2025-3-28 23:23 作者: 兩棲動物 時間: 2025-3-29 05:48
Lothar Spie?,Robert Schwarzer,Gerd Teichertnswered in constant time. The space required is ..)..We apply the proposed technique to various problems about dominance, providing the first known incremental and decrementai solutions for maintaining the ., the ., and the . of a dag.作者: bourgeois 時間: 2025-3-29 10:47
Moderne Stationsorganisation im Krankenhaus forbidden isometric subgraphs for which any LexBFS-ordering of the graph is a common perfect elimination ordering of all its nontrivial powers. As an application we get a linear time approximation of the diameter for weak bipolarizable graphs, a subclass of HHD-free graphs containing all chordal gr作者: CHYME 時間: 2025-3-29 13:13
Andriy Luntovskyy,Dietbert Gütterile the guest graph can grow arbitrarily large depending on the application. The results of this paper widen the class of computations that can be performed on these product graphs which are often cited as being low-cost alternatives for hypercubes.作者: mydriatic 時間: 2025-3-29 19:22 作者: 機警 時間: 2025-3-29 21:25 作者: 懶鬼才會衰弱 時間: 2025-3-30 01:17 作者: 使乳化 時間: 2025-3-30 06:14
More general parallel tree contraction: Register allocation and broadcasting in a tree,bor in each step. We show that on inputs of size ., both problems can be solved with optimal speedup in .((log .).) time on an EREW PRAM, in .(log . log log .) time on a CREW PRAM, and in .(log .) time on a CRCW PRAM.作者: Ordnance 時間: 2025-3-30 08:15
Efficient algorithms for shortest path queries in planar digraphs,f constant treewidth. We describe efficient algorithms for this problem for any class of digraphs for which an . separator theorem holds. For such graphs our algorithm uses . space and answers queries in ../. time, for any previously chosen . ? [..]. For the class of planar digraphs improved algorithms are described.作者: Confirm 時間: 2025-3-30 13:04
Improved approximations of independent dominating set in bounded degree graphs, .-regular graphs, for . ≥ 4. In particular, the greedy phase proposed for at most cubic graphs is extended to any . and iteratively repeated until the degree of the remaining graph is greater than 3. Finally, the algorithm for at most cubic graphs is executed..Our algorithms achieve approximation ratios:作者: 迷住 時間: 2025-3-30 18:33 作者: FOR 時間: 2025-3-30 21:18 作者: 嬉耍 時間: 2025-3-31 04:41 作者: narcotic 時間: 2025-3-31 09:01
Detecting diamond necklaces in labeled dags,ssical patterns encountered in distributed debugging. Then an efficient polynomial time algorithm detecting such patterns in a labeled dag is presented. To be easily adapted to an on-the-fly detection of the pattern in distributed executions, the algorithm visits the nodes of the graph according to a topological sort strategy.作者: 刺激 時間: 2025-3-31 09:12 作者: abreast 時間: 2025-3-31 16:38 作者: Redundant 時間: 2025-3-31 20:07 作者: 金桌活畫面 時間: 2025-3-31 22:30 作者: nitroglycerin 時間: 2025-4-1 03:07
A new characterization of ,,-connected graphs,that, given two distinct vertices, exhibits a ..-chain connecting them. In addition to shedding new light on the structure of ..-connected graphs, our result extends a previously known theorem about the ..-structure of unbreakable graphs.作者: BRAND 時間: 2025-4-1 08:09 作者: largesse 時間: 2025-4-1 14:07
