書目名稱Graph-Theoretic Concepts in Computer Science影響因子(影響力)學科排名
書目名稱Graph-Theoretic Concepts in Computer Science網(wǎng)絡公開度
書目名稱Graph-Theoretic Concepts in Computer Science網(wǎng)絡公開度學科排名
書目名稱Graph-Theoretic Concepts in Computer Science被引頻次
書目名稱Graph-Theoretic Concepts in Computer Science被引頻次學科排名
書目名稱Graph-Theoretic Concepts in Computer Science年度引用
書目名稱Graph-Theoretic Concepts in Computer Science年度引用學科排名
書目名稱Graph-Theoretic Concepts in Computer Science讀者反饋
書目名稱Graph-Theoretic Concepts in Computer Science讀者反饋學科排名
作者: 種族被根除 時間: 2025-3-21 23:27
The Maximum Weight Stable Set Problem in (,, bull)-Free Graphs,We present a polynomial-time algorithm that finds a maximum weight stable set in a graph that does not contain as an induced subgraph an induced path on six vertices or a bull (the graph with vertices .,?.,?.,?.,?. and edges .,?.,?.,?.,?.).作者: 畏縮 時間: 2025-3-22 00:30
Graph-Theoretic Concepts in Computer Science978-3-662-53536-3Series ISSN 0302-9743 Series E-ISSN 1611-3349 作者: 確定方向 時間: 2025-3-22 04:36 作者: 蕨類 時間: 2025-3-22 12:01
Approximate Association via Dissociation,or a single edge. Interestingly, . is then precisely a graph containing no induced .’s or containing no .’s, respectively. We observe some special structures and show that if none of them exists, then the minimum association set problem can be reduced to the minimum (weighted) dissociation set probl作者: certain 時間: 2025-3-22 14:12
Geodetic Convexity Parameters for Graphs with Few Short Induced Paths,tion posed by Araujo et al., we show that computing the geodetic hull number of a given .-free graph is NP-hard. Similarly, we show that computing the geodetic interval number of a given .-free graph is NP-hard. On the positive side, we identify several graph classes for which the geodetic hull numb作者: certain 時間: 2025-3-22 17:10 作者: construct 時間: 2025-3-22 23:26
Saving Colors and Max Coloring: Some Fixed-Parameter Tractability Results, Here, we tackle this problem under the framework of parameterized complexity. In particular, we first show to what extend the result of [.] - saving colors from the trivial bound of . on the chromatic number - extends to Max Coloring. Then we consider possible improvements of these results by consi作者: 簡潔 時間: 2025-3-23 02:13
Finding Two Edge-Disjoint Paths with Length Constraints,dges and the length of each . satisfies ., where .. We regard . and . as parameters and investigate the parameterized complexity of the above problem when at least one of . and . has a length constraint (note that .” indicates that . has no length constraint). For the nine different cases of ., we o作者: elastic 時間: 2025-3-23 07:24 作者: Osmosis 時間: 2025-3-23 13:38
Exhaustive Generation of ,-Critical ,-Free Graphs,only finitely many 4-critical .-free graphs, for both . and .. We also show that there are only finitely many 4-critical .-free graphs. For each case of these cases we also give the complete lists of critical graphs and vertex-critical graphs. These results generalize previous work by Hell and Huang作者: Demulcent 時間: 2025-3-23 17:03 作者: Crumple 時間: 2025-3-23 20:13 作者: ONYM 時間: 2025-3-24 00:19
Eccentricity Approximating Trees,al graph admits an eccentricity 2-approximating spanning tree. That is, every chordal graph . has a spanning tree . such that . for every vertex ., where . (.) is the eccentricity of a vertex . in . (in ., respectively). Using only metric properties of graphs, we extend that result to a much larger 作者: 潛移默化 時間: 2025-3-24 06:23 作者: Carcinoma 時間: 2025-3-24 10:19
Vertex Cover Structural Parameterization Revisited,uch that . is a pseudoforest. We show that . admits a polynomial kernel being parameterized by the size of the pseudoforest modulator. In other words, we provide a polynomial time algorithm that for an input graph . and integer ., outputs a graph . and integer ., such that . has . vertices and . has作者: NIB 時間: 2025-3-24 12:09 作者: angina-pectoris 時間: 2025-3-24 18:39 作者: 是剝皮 時間: 2025-3-24 20:59 作者: notice 時間: 2025-3-25 00:49
Almost Induced Matching: Linear Kernels and Parameterized Algorithms, vertex of degree?1. This paper studies parameterized algorithms for this problem by taking the size of deletion set . as the parameter. By using the techniques of finding maximal 3-path packings and an extended crown decomposition, we obtain the first linear vertex kernel for this problem, improvin作者: 表主動 時間: 2025-3-25 06:04
Molecular Evolution and Protobiologye sequence. The length of a shortest .-radius sequence for . is denoted by ...Such sequences appear in a problem related to computing values of some 2-argument functions. Suppose we have a set . of large objects, stored in an external database, and our cache can accommodate at most . objects from . 作者: hermetic 時間: 2025-3-25 09:20
https://doi.org/10.1007/978-1-4613-1407-3or a single edge. Interestingly, . is then precisely a graph containing no induced .’s or containing no .’s, respectively. We observe some special structures and show that if none of them exists, then the minimum association set problem can be reduced to the minimum (weighted) dissociation set probl作者: 溫室 時間: 2025-3-25 12:14
Yechiel Becker,Gholamreza Daraition posed by Araujo et al., we show that computing the geodetic hull number of a given .-free graph is NP-hard. Similarly, we show that computing the geodetic interval number of a given .-free graph is NP-hard. On the positive side, we identify several graph classes for which the geodetic hull numb作者: inflame 時間: 2025-3-25 16:10
https://doi.org/10.1007/978-94-007-2217-0exactly one vertex of .. The . (ED) problem, which asks for the existence of an e.d.s. in ., is known to be .-complete for .-free graphs and solvable in polynomial time for .-free graphs. The .-free case was the last open question for the complexity of ED on .-free graphs..Recently, Lokshtanov, Pili作者: 指數(shù) 時間: 2025-3-25 20:22 作者: 疏遠天際 時間: 2025-3-26 02:32
https://doi.org/10.1007/1-4020-3689-2dges and the length of each . satisfies ., where .. We regard . and . as parameters and investigate the parameterized complexity of the above problem when at least one of . and . has a length constraint (note that .” indicates that . has no length constraint). For the nine different cases of ., we o作者: magenta 時間: 2025-3-26 05:38
https://doi.org/10.1007/978-3-642-87534-2e integer .. A solution is an assignment of (power) values to the vertices, so that for each edge one of its endpoints has value as high as the demand, and the total sum of power values assigned is minimized..We investigate how this generalization affects the complexity of . from the point of view o作者: MULTI 時間: 2025-3-26 11:12 作者: etidronate 時間: 2025-3-26 16:17
https://doi.org/10.1007/978-981-16-6005-4call two edges . and . of . . if the set of endpoints . induces a . in .. The . of a graph . is the smallest cardinality of a family . of linear orders of .(.) such that every pair of strongly independent edges in . are separated in at least one of the linear orders in .. For each ., the family of g作者: 上腭 時間: 2025-3-26 19:13
Gary R. Carvalho,Tony J. Pitchernct values. That is, these . instances exhibit . .. They further showed how to construct from . a tree . that stores all minimum .-cut values. Motivated by this result, we obtain . bounds for the redundancy factor of several generalizations of the minimum .-cut problem..A natural application of thes作者: 臆斷 時間: 2025-3-26 23:39 作者: Immunization 時間: 2025-3-27 02:52 作者: CON 時間: 2025-3-27 05:45 作者: indoctrinate 時間: 2025-3-27 12:08 作者: amnesia 時間: 2025-3-27 17:33
https://doi.org/10.1007/978-1-4939-1683-2geover cost. The . (.) problem consists in finding an arborescence with a given root vertex such that the total changeover cost of the internal vertices is minimized. It has been recently proved by G?züpek ..?[.] that the . problem is . when parameterized by the treewidth and the maximum degree of t作者: 作嘔 時間: 2025-3-27 19:14
https://doi.org/10.1007/978-1-4614-8256-7f and only if their corresponding paths share infinitely many points. In this paper we focus on graphs admitting EPG-representations by paths with at most 2 bends. We show hardness of the recognition problem for this class of graphs, along with some subclasses..We also initiate the study of graphs r作者: 百靈鳥 時間: 2025-3-28 01:13 作者: 混亂生活 時間: 2025-3-28 05:13 作者: 刪除 時間: 2025-3-28 08:33 作者: Confound 時間: 2025-3-28 11:46 作者: 輕浮思想 時間: 2025-3-28 15:57
https://doi.org/10.1007/978-1-4939-1683-2es is minimized. It has been recently proved by G?züpek ..?[.] that the . problem is . when parameterized by the treewidth and the maximum degree of the input graph. In this article we present the following results for .:作者: 挫敗 時間: 2025-3-28 20:55
https://doi.org/10.1007/978-3-030-28703-0techniques of finding maximal 3-path packings and an extended crown decomposition, we obtain the first linear vertex kernel for this problem, improving the previous quadratic kernel. We also present an .-time and polynomial-space algorithm, which is the best known parameterized algorithm for this problem.作者: 紳士 時間: 2025-3-29 01:46
https://doi.org/10.1007/978-1-4613-1407-3on a combinatorial study of modular decomposition of graphs free of these special structures. Further, a novel algorithmic use of modular decomposition enables us to implement this approach in . time.作者: COST 時間: 2025-3-29 04:21 作者: achlorhydria 時間: 2025-3-29 09:36 作者: Decrepit 時間: 2025-3-29 13:46 作者: TRUST 時間: 2025-3-29 18:36 作者: DEFER 時間: 2025-3-29 22:20 作者: emulsify 時間: 2025-3-30 03:19 作者: ULCER 時間: 2025-3-30 06:59
Eccentricity Approximating Trees,ose two heuristics for constructing eccentricity .-approximating trees with small values of . for general unweighted graphs. We validate those heuristics on a set of real-world networks and demonstrate that all those networks have very good eccentricity approximating trees.作者: ENACT 時間: 2025-3-30 10:32 作者: Crumple 時間: 2025-3-30 15:38
,On Distance-, Independent Set and Other Problems in Graphs with “few” Minimal Separators, even .. The problem is NP-hard on chordal graphs for any odd .?[.]..We also provide polynomial algorithms for . and . on subclasses of . including chordal and circular-arc graphs, and we discuss variants of independent domination problems.作者: TSH582 時間: 2025-3-30 17:16 作者: Pigeon 時間: 2025-3-30 20:49 作者: 新義 時間: 2025-3-31 02:33 作者: Anthrp 時間: 2025-3-31 08:47
Yechiel Becker,Gholamreza Daraier can be computed efficiently. Furthermore, following a suggestion of Campos et al., we show that the geodetic interval number, the geodetic convexity number, the geodetic Carathéodory number, and the geodetic Radon number can all be computed in polynomial time for .-graphs.作者: 獎牌 時間: 2025-3-31 11:46
https://doi.org/10.1007/978-94-017-2317-6dering the problem of saving colors/weight with respect to a better bound on the chromatic number. Finally, we consider the fixed parameterized tractability of Max Coloring in restricted graph classes under standard parameterization.作者: Epithelium 時間: 2025-3-31 13:37 作者: 薄荷醇 時間: 2025-3-31 17:55 作者: NUDGE 時間: 2025-4-1 00:54 作者: 省略 時間: 2025-4-1 04:47 作者: LIMN 時間: 2025-4-1 09:47
Saving Colors and Max Coloring: Some Fixed-Parameter Tractability Results,dering the problem of saving colors/weight with respect to a better bound on the chromatic number. Finally, we consider the fixed parameterized tractability of Max Coloring in restricted graph classes under standard parameterization.作者: Amenable 時間: 2025-4-1 13:29
Finding Two Edge-Disjoint Paths with Length Constraints,btain FPT algorithms for seven of them. Our algorithms uses random partition backed by some structural results. On the other hand, we prove that the problem admits no polynomial kernel for all nine cases unless ..