書目名稱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é)科排名
作者: 防水 時(shí)間: 2025-3-21 22:43
https://doi.org/10.1057/9780230339194r, we improve this result to the clique-width of . ≤ 3 * 2. and more importantly show that there is an exponential lower bound on this relationship. In particular, for any ., there is a graph . with treewidth = . where the clique-width of . ≥ 2..作者: 不理會(huì) 時(shí)間: 2025-3-22 00:29 作者: Trigger-Point 時(shí)間: 2025-3-22 08:17
On the Relationship between Clique-Width and Treewidth,r, we improve this result to the clique-width of . ≤ 3 * 2. and more importantly show that there is an exponential lower bound on this relationship. In particular, for any ., there is a graph . with treewidth = . where the clique-width of . ≥ 2..作者: Ceramic 時(shí)間: 2025-3-22 09:42 作者: 基因組 時(shí)間: 2025-3-22 13:11
https://doi.org/10.1007/978-1-349-14218-7f minimum cardinality. We consider the problem for planar graphs and present fixed parameter and approximation results..We also examine some other graph classes: subclasses of chordal graphs such as k-trees, strongly chordal graphs, etc., graphs with few . ., comparability graphs, and distance hereditary graphs.作者: 基因組 時(shí)間: 2025-3-22 20:32
https://doi.org/10.1007/978-3-031-32107-8graphs, diamond-free graphs and chordal graphs. The number of minimal separators of graphs with bounded tree-degree is polynomial. This implies that the treewidth of graphs with bounded tree-degree can be computed efficiently, even without the model given in advance.作者: BRIBE 時(shí)間: 2025-3-23 00:28
erized computation are nicely combined and extended. The algorithm is practically efficient with running time bounded by .(1.26. + .), where . is the size of the constrained minimum vertex cover in the input graph. The algorithm is a significant improvement over the previous algorithms for the problem.作者: 舊石器 時(shí)間: 2025-3-23 02:35 作者: 施加 時(shí)間: 2025-3-23 06:30
https://doi.org/10.1007/978-3-319-66131-5 sufficient planarity criterion in terms of projection paths over a spanning subtree of a graph. Using this criterion, we show that the 2-level cactus of . is planar if the cardinality of a minimum edge-cut of . is not equal to 2, 3 or 5. On the other hand, we give examples for non-planar 2-level cacti of graphs with these connectivities.作者: OWL 時(shí)間: 2025-3-23 12:35
t families of graphs such as trees, cycles, complete bipartite graphs, outerplanar graphs and 2-dimensional grids. We also study and give bounds for the star chromatic number of other families of graphs, such as hypercubes, tori, .-dimensional grids, graphs with bounded treewidth and planar graphs.作者: 嫌惡 時(shí)間: 2025-3-23 14:19 作者: 連鎖,連串 時(shí)間: 2025-3-23 18:07
Edge-Isoperimetric Problems for Cartesian Powers of Regular Graphs,es all presently known graphs with this property. Our new results are applied to derive best possible edge-isoperimetric inequalities for the cartesian powers of arbitrary regular, resp. regular bipartite, graphs with a high density.作者: 倔強(qiáng)一點(diǎn) 時(shí)間: 2025-3-23 23:01
Maximum Clique Transversals,f minimum cardinality. We consider the problem for planar graphs and present fixed parameter and approximation results..We also examine some other graph classes: subclasses of chordal graphs such as k-trees, strongly chordal graphs, etc., graphs with few . ., comparability graphs, and distance hereditary graphs.作者: 冒號(hào) 時(shí)間: 2025-3-24 04:18 作者: Subdue 時(shí)間: 2025-3-24 09:33 作者: eucalyptus 時(shí)間: 2025-3-24 14:06
(,+) -Disatance- Herediatry Graphs,.. The class of all these graphs is denoted by DH(., +) By varying the parameter ., classes DH(., +) form a hierarchy that represents a parametric extension of the well-known class of distance-hereditary graphs, and include all graphs.作者: 遺棄 時(shí)間: 2025-3-24 16:03 作者: 顧客 時(shí)間: 2025-3-24 21:17 作者: acrophobia 時(shí)間: 2025-3-25 02:41
Small ,-Dominating Sets in Planar Graphs with Applications, = O(1/ε). For several subclasses of planar graphs of diameter ., we show that γ.(.) is bounded by a constant for . ? ./2. We conjecture that the same result holds for every planar graph. This problem is motivated by the design of routing schemes with compact data structures.作者: Keratectomy 時(shí)間: 2025-3-25 07:01
Modernization of Electric Power Systems, recognizing .-subcolorable graphs is NP-complete on graphs with maximum degree at most . .. In contrast, we show that, for arbitrary ., .-. can be computed efficiently on graphs of bounded treewidth and on cographs.作者: 徹底檢查 時(shí)間: 2025-3-25 09:59
Graph Subcolorings: Complexity and Algorithms,, recognizing .-subcolorable graphs is NP-complete on graphs with maximum degree at most . .. In contrast, we show that, for arbitrary ., .-. can be computed efficiently on graphs of bounded treewidth and on cographs.作者: 假裝是我 時(shí)間: 2025-3-25 13:28
Median Hulls as Steiner Hulls in Rectilinear and Molecular Sequence Spaces,nditions, then a solution, a . for ., exists [.]. More generally, considering any graph-theoretic tree . with all nodes of degree < 3 labeled by elements of . (that is, an .), we may ask for a minimal length realization of . in (.), that is, for an embedding of the node set of . in . which extends t作者: 職業(yè)拳擊手 時(shí)間: 2025-3-25 19:33
Data Management in Networks,bal variables in a parallel program, pages or cach lines in a virtual shared memory system, or shared files in a distributed system, for example in a distributed data server. We focus on strategies for distributing, accessing, and (consistently) updating such objects, which are provably efficient wi作者: audiologist 時(shí)間: 2025-3-25 21:36
Edge-Isoperimetric Problems for Cartesian Powers of Regular Graphs,tesian powers the lexicographic order provides nested solutions for the EIP. We present several new classes of such graphs that include as special cases all presently known graphs with this property. Our new results are applied to derive best possible edge-isoperimetric inequalities for the cartesia作者: 蠟燭 時(shí)間: 2025-3-26 00:46
Approximate Constrained Bipartite Edge Coloring, colored with . colors. We wish to complete the coloring of the edges of . minimizing the total number of colors used. The problem has been proved to be NP-hard even for bipartite graphs of maximum degree three [.]. In previous work Caragiannis et al. [.] consider two special cases of the problem an作者: Exposure 時(shí)間: 2025-3-26 04:55
Maximum Clique Transversals,ersal set reduces the clique number of a graph. We study algorithmic aspects of the problem, given a graph, to find a maximum clique transversal set of minimum cardinality. We consider the problem for planar graphs and present fixed parameter and approximation results..We also examine some other gra作者: Vertical 時(shí)間: 2025-3-26 12:03 作者: 黃油沒(méi)有 時(shí)間: 2025-3-26 15:47
On Constrained Minimum Vertex Covers of Bipartite Graphs: Improved Algorithms, In this paper, we develop a new algorithm for the problem, in which classical results in matching theory and recently developed techniques in parameterized computation are nicely combined and extended. The algorithm is practically efficient with running time bounded by .(1.26. + .), where . is the 作者: Coma704 時(shí)間: 2025-3-26 17:24 作者: BAIT 時(shí)間: 2025-3-26 23:45
On the Relationship between Clique-Width and Treewidth,t shares one of the powerful properties of treewidth, namely: if a graph is of bounded treewidth (or clique-width), then there is a polynomial time algorithm for any graph problem expressible in Monadic Second Order Logic, using quantifiers on vertices (in the case of clique-width you must assume a 作者: 到婚嫁年齡 時(shí)間: 2025-3-27 02:09 作者: 暫時(shí)別動(dòng) 時(shí)間: 2025-3-27 07:10 作者: incredulity 時(shí)間: 2025-3-27 09:57 作者: 被詛咒的人 時(shí)間: 2025-3-27 15:33
On Star Coloring of Graphs,rs are assigned the same color) such that any path of length 3 in . is not bicolored..We give the exact value of the star chromatic number of different families of graphs such as trees, cycles, complete bipartite graphs, outerplanar graphs and 2-dimensional grids. We also study and give bounds for t作者: 得意人 時(shí)間: 2025-3-27 21:45 作者: 陶器 時(shí)間: 2025-3-28 00:06
Approximation of Pathwidth of Outerplanar Graphs,In this paper, we give an algorithm, that given a biconnected outerplanar graph ., finds a path decomposition of . of pathwidth at most twice the pathwidth of . plus one. To obtain the result, several relations between the pathwidth of a biconnected outerplanar graph and its dual are established.作者: 沉積物 時(shí)間: 2025-3-28 03:46
On the Monotonicity of Games Generated by Symmetric Submodular Functions,game theoretic framework able to unify old and new monotonicity results in a unique min-max theorem. Our theorem, provides a game theoretic analogue to a wide number of graph theoretic parameters such as linear-width and cutwidth.作者: 和平主義 時(shí)間: 2025-3-28 07:38
Multiple Hotlink Assignment, the weighted shortest path length rooted at . by adding a restricted number of outgoing arcs (.) to each node. The (.)-hotlink assignment problem is defined on .-regular complete trees, and at most . hotlinks can be assigned to each node.We contribute algorithms for the (1, .), (2, .), and (.-1, .)作者: AVERT 時(shí)間: 2025-3-28 10:30 作者: 安撫 時(shí)間: 2025-3-28 17:46
https://doi.org/10.1057/978-1-137-49676-8nditions, then a solution, a . for ., exists [.]. More generally, considering any graph-theoretic tree . with all nodes of degree < 3 labeled by elements of . (that is, an .), we may ask for a minimal length realization of . in (.), that is, for an embedding of the node set of . in . which extends t作者: ticlopidine 時(shí)間: 2025-3-28 18:49 作者: Employee 時(shí)間: 2025-3-29 01:14
Modernity and Meaning in Victorian Londontesian powers the lexicographic order provides nested solutions for the EIP. We present several new classes of such graphs that include as special cases all presently known graphs with this property. Our new results are applied to derive best possible edge-isoperimetric inequalities for the cartesia作者: 軟弱 時(shí)間: 2025-3-29 06:54
https://doi.org/10.1057/9781403907097 colored with . colors. We wish to complete the coloring of the edges of . minimizing the total number of colors used. The problem has been proved to be NP-hard even for bipartite graphs of maximum degree three [.]. In previous work Caragiannis et al. [.] consider two special cases of the problem an作者: browbeat 時(shí)間: 2025-3-29 09:12 作者: 瘋狂 時(shí)間: 2025-3-29 14:09
https://doi.org/10.1007/978-3-031-32107-8 a subtree intersection model. Computing the tree-degree is NP-complete even for planar graphs, but polynomial time algorithms exist for outer-planar graphs, diamond-free graphs and chordal graphs. The number of minimal separators of graphs with bounded tree-degree is polynomial. This implies that t作者: 擁護(hù) 時(shí)間: 2025-3-29 17:31 作者: Assault 時(shí)間: 2025-3-29 23:20 作者: 處理 時(shí)間: 2025-3-30 02:08
https://doi.org/10.1057/9780230339194t shares one of the powerful properties of treewidth, namely: if a graph is of bounded treewidth (or clique-width), then there is a polynomial time algorithm for any graph problem expressible in Monadic Second Order Logic, using quantifiers on vertices (in the case of clique-width you must assume a 作者: CHART 時(shí)間: 2025-3-30 06:02
https://doi.org/10.1007/978-3-319-66131-5cted multi-graph . in a compact way. In this paper, we study planarity of the 2-level cactus, which can be used, e.g., in graph drawing. We give a new sufficient planarity criterion in terms of projection paths over a spanning subtree of a graph. Using this criterion, we show that the 2-level cactus作者: Blood-Clot 時(shí)間: 2025-3-30 10:22
https://doi.org/10.1007/978-981-19-5809-0rent subclasses. Moreover, this approach works well also on graphs with small size of largest induced cycle and gives a unified way to solve the . and . problems on different graph classes including chordal, strongly chordal, chordal bipartite, and distance-hereditary graphs.作者: 險(xiǎn)代理人 時(shí)間: 2025-3-30 15:18 作者: LIMIT 時(shí)間: 2025-3-30 18:15 作者: Ceramic 時(shí)間: 2025-3-31 00:32
Modernization of Electric Power Systemsor class induces a disjoint union of complete graphs. Erd?s and independently Albertson et al. proved that every graph of maximum degree at most 3 has a 2-subcoloring.We point out in this paper that this fact is best possible with respect to degree-constraints by showing that the problem of recogniz作者: machination 時(shí)間: 2025-3-31 04:28 作者: 厚顏 時(shí)間: 2025-3-31 06:51 作者: hysterectomy 時(shí)間: 2025-3-31 10:06
Modernizing NATO’s Nuclear Weapons the weighted shortest path length rooted at . by adding a restricted number of outgoing arcs (.) to each node. The (.)-hotlink assignment problem is defined on .-regular complete trees, and at most . hotlinks can be assigned to each node.We contribute algorithms for the (1, .), (2, .), and (.-1, .)作者: 過(guò)多 時(shí)間: 2025-3-31 16:21
https://doi.org/10.1007/978-94-6265-519-5 defined as the cardinality of the smallest .-dominating set of .. For planar graphs, we show that for every ε > 0 and for every . ? (5/7 + ε)., γ.(.) = O(1/ε). For several subclasses of planar graphs of diameter ., we show that γ.(.) is bounded by a constant for . ? ./2. We conjecture that the same作者: optic-nerve 時(shí)間: 2025-3-31 18:15 作者: Monocle 時(shí)間: 2025-4-1 01:43 作者: overhaul 時(shí)間: 2025-4-1 01:53 作者: 繁重 時(shí)間: 2025-4-1 07:36
https://doi.org/10.1007/978-3-030-32984-6ood competitive ratio, i.e., that are efficient compared to an optimal dynamic ofine strategy that is constructed using full knowledge of the dynamic access pattern. Especially the case of memory restrictions in the processors will be discussed.
