書目名稱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é)科排名
作者: hegemony 時間: 2025-3-22 00:12 作者: 平庸的人或物 時間: 2025-3-22 02:48
https://doi.org/10.1007/978-4-431-98074-2h that the blocks are factors of the extension. This is a general technique applicable to different de compositions [2, 1]. The unicity of the block decomposition comes from a proposition showing the links between blocks and modules of the well known modular decomposition of directed graphs, and fro作者: coltish 時間: 2025-3-22 08:22 作者: Ruptured-Disk 時間: 2025-3-22 10:40 作者: 設(shè)施 時間: 2025-3-22 13:50 作者: 設(shè)施 時間: 2025-3-22 17:36
https://doi.org/10.1007/978-1-4939-2169-0nt of one optimization problem into constraints of a different one. Despite their central role, no uniform method has been developed to construct gadgets required for a given reduction. In fact till recently no formal definition seems to have been given. In a recent work Bellare, Goldreich, and Suda作者: 都相信我的話 時間: 2025-3-22 22:17 作者: Ventricle 時間: 2025-3-23 02:30
https://doi.org/10.1007/978-3-642-25301-0ound on .(.) constructing graphs with at least 2.27. cycles. Applying some probabilistic arguments we prove an upper bound of 3.37...We also discuss this question restricted to the subclasses of grid graphs, bipartite graphs, and of 3-colorable triangulated graphs.作者: FIR 時間: 2025-3-23 06:38
Suresh I. S. Rattan,Olivier Toussainton a previously known structure theorem which decomposes a graph into its ..-connected components and on a new decomposition theorem for ..-connected graphs. As a final result we obtain a tree representation for arbitrary graphs which is unique to isomorphism.作者: Costume 時間: 2025-3-23 10:53
Molecular Histochemical Techniquesic results on pseudo- .-hamiltonian cycles: First, we show that deciding whether a graph is pseudo-.-hamiltonian is NP-complete for any given . ≥ 1. Surprisingly, deciding whether there exists an . ≥ 1 such that the graph is pseudo-.-hamiltonian, can be done in polynomial time. We also present suffi作者: 推延 時間: 2025-3-23 17:44 作者: Irascible 時間: 2025-3-23 19:57
Molecular Identification of Fungien we present a graph representing all of the minimal weak-order extensions of a partially ordered set, and implying a generation algorithm. Finally, we prove that the number of weak-order extensions of a partially ordered set is a comparability invariant, whereas the number of minimal weak-order ex作者: Ardent 時間: 2025-3-24 01:37 作者: Nostalgia 時間: 2025-3-24 06:11 作者: padding 時間: 2025-3-24 09:22 作者: 緩和 時間: 2025-3-24 13:09 作者: 延期 時間: 2025-3-24 16:34 作者: employor 時間: 2025-3-24 21:25 作者: CERE 時間: 2025-3-25 01:40 作者: Feckless 時間: 2025-3-25 05:43 作者: 巫婆 時間: 2025-3-25 08:07 作者: 無法解釋 時間: 2025-3-25 15:33
Gadgets, approximation, and linear programming: Improved hardness results for cut and satisfiabilitnt of one optimization problem into constraints of a different one. Despite their central role, no uniform method has been developed to construct gadgets required for a given reduction. In fact till recently no formal definition seems to have been given. In a recent work Bellare, Goldreich, and Suda作者: dry-eye 時間: 2025-3-25 19:02 作者: 發(fā)生 時間: 2025-3-25 22:46 作者: 宿醉 時間: 2025-3-26 00:54 作者: Acquired 時間: 2025-3-26 04:50
Pseudo-hamiltonian graphs,ic results on pseudo- .-hamiltonian cycles: First, we show that deciding whether a graph is pseudo-.-hamiltonian is NP-complete for any given . ≥ 1. Surprisingly, deciding whether there exists an . ≥ 1 such that the graph is pseudo-.-hamiltonian, can be done in polynomial time. We also present suffi作者: 退出可食用 時間: 2025-3-26 11:00 作者: CUMB 時間: 2025-3-26 16:20 作者: prodrome 時間: 2025-3-26 18:34 作者: crutch 時間: 2025-3-26 22:20
Computing the independence number of dense triangle-free graphs,s remains valid if the minimum degree is required to be large. While in general graphs this problem remains .-hard even within the class of graphs with minimum degree δ > (1 ? ε)., the situation is different for triangle-free graphs. It will be shown that for triangle-free graphs with δ > ./3 the in作者: 鐵砧 時間: 2025-3-27 04:10 作者: 青石板 時間: 2025-3-27 05:43 作者: gerontocracy 時間: 2025-3-27 12:25 作者: 天然熱噴泉 時間: 2025-3-27 15:56 作者: 勾引 時間: 2025-3-27 19:59
On greedy matching ordering and greedy matchable graphs, for which a vertex ordering exists such that the greedy algorithm always yields maximum cardinality matchings for each induced subgraph. We show that these graphs, called greedy matchable graphs, are a subclass of weakly triangulated graphs and contain strongly chordal graphs and chordal bipartite 作者: 使糾纏 時間: 2025-3-27 23:36 作者: Invigorate 時間: 2025-3-28 05:24 作者: AVID 時間: 2025-3-28 07:29
Graph-Theoretic Concepts in Computer Science978-3-540-69643-8Series ISSN 0302-9743 Series E-ISSN 1611-3349 作者: Aggregate 時間: 2025-3-28 13:10
https://doi.org/10.1007/978-981-15-9456-4Let . be the value of the maximum cut of a graph .. Let . be the expectation of . for random graphs with . vertices and . edges and let . be the expectation of . for random 2.-regular graphs with . vertices. We prove, for sufficiently large .: 作者: Facilities 時間: 2025-3-28 18:12
https://doi.org/10.1007/978-3-030-19019-4We consider the following problem, called .. Given a graph . which is a subgraph of the chordal graph .; compute an inclusion minimal chordal graph . = (.), such that .. We show that this can be done in .(.) time. This extends the results of [2]. The algorithm is also simpler and is based only on well known results on chordal graphs.作者: GLOOM 時間: 2025-3-28 20:47 作者: defile 時間: 2025-3-28 23:23 作者: Mediocre 時間: 2025-3-29 03:48 作者: LASH 時間: 2025-3-29 09:37
Suresh I. S. Rattan,Olivier Toussainton a previously known structure theorem which decomposes a graph into its ..-connected components and on a new decomposition theorem for ..-connected graphs. As a final result we obtain a tree representation for arbitrary graphs which is unique to isomorphism.作者: Tractable 時間: 2025-3-29 13:30 作者: anesthesia 時間: 2025-3-29 19:27 作者: Facilities 時間: 2025-3-29 22:22 作者: Project 時間: 2025-3-30 02:38
-completeness results for minimum planar spanners, 5. We thus extend results on that problem to the interesting case where the instances are known to be planar. We also introduce the related problem of finding minimum .-spanners and establish its .-hardness for similar fixed values of ..作者: initiate 時間: 2025-3-30 05:10 作者: 飛來飛去真休 時間: 2025-3-30 09:56
H. H. Hagedorn,J. G. Hildebrand,J. H. Law.-complete for chordal graphs in general, while the Krausz dimension of a chordal graph with bounded clique size can be determined in polynomial time. We also show that for any fixed k, it can be decided in polynomial time if an interval graph has Krausz dimension at most ..作者: Cuisine 時間: 2025-3-30 13:04
Off-line and on-line call-scheduling in stars and trees,S for calls with unit durations is shown to have performance ratio at most .. In tree networks with . nodes, a variant of LS for calls with unit durations has performance ratio at most 6, and a variant for calls with arbitrary durations has performance ratio at most 5 log ..作者: Occupation 時間: 2025-3-30 19:00
Computational complexity of the Krausz dimension of graphs,.-complete for chordal graphs in general, while the Krausz dimension of a chordal graph with bounded clique size can be determined in polynomial time. We also show that for any fixed k, it can be decided in polynomial time if an interval graph has Krausz dimension at most ..作者: 拾落穗 時間: 2025-3-31 00:07
Non-oblivious local search for MAX 2-CCSP with application to MAX DICUT,llows to change either one item, or all the items in the current solution. The total time required to maintain 5/2-approximate solutions, while an arbitrary sequence of q constraint insertions and deletions is performed, is .. + . · .). This give .(.) amortized time per update over a sequence of .(.) operations.作者: Innocence 時間: 2025-3-31 02:25 作者: Trigger-Point 時間: 2025-3-31 08:39
Computing the independence number of dense triangle-free graphs,h minimum degree δ > (1 ? ε)., the situation is different for triangle-free graphs. It will be shown that for triangle-free graphs with δ > ./3 the independence number can be computed as fast as matrix multiplication, while within the class of triangle-free graphs with δ > (1-ε)./4 the problem is already .-hard.作者: Progesterone 時間: 2025-3-31 09:46 作者: Ossification 時間: 2025-3-31 15:16 作者: 出血 時間: 2025-3-31 19:32
On greedy matching ordering and greedy matchable graphs, these graphs, called greedy matchable graphs, are a subclass of weakly triangulated graphs and contain strongly chordal graphs and chordal bipartite graphs as proper subclasses. The question when can this ordering be produced efficiently is discussed too.作者: Pageant 時間: 2025-4-1 01:17 作者: troponins 時間: 2025-4-1 04:32
Molecular Identification of Fungiwe prove that the number of weak-order extensions of a partially ordered set is a comparability invariant, whereas the number of minimal weak-order extensions of a partially ordered set is not a comparability invariant.作者: 獨行者 時間: 2025-4-1 06:45
