書目名稱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讀者反饋學科排名
作者: DECRY 時間: 2025-3-21 20:26
On Fair Covering and Hitting Problems,t number of colors. Next, for the . problem, we design an . time exact algorithm, via a chain of reductions to a matching problem. For all intermediate problems in this chain of reductions, we design polynomial time algorithms, which might be of independent interest.作者: 鋸齒狀 時間: 2025-3-22 03:55 作者: 演講 時間: 2025-3-22 06:13
Biophysics for the Life Sciencest function of . and the maximum size of a minor obstruction of .. This implies that the problem of deciding whether . is . fixed parameter tractable, when parameterized by .. Our results are based on a structural characterization of the obstructions of ., relatively to the obstructions of .. Finally作者: 誓言 時間: 2025-3-22 08:52 作者: gait-cycle 時間: 2025-3-22 14:40
Developments in Molecular Virologys. Chordal distance-hereditary graphs are a natural generalization of trivially perfect graphs and have been extensively studied from the structural viewpoint. However, to the best of our knowledge, completion to chordal distance-hereditary graphs has not received attention so far. We thus initiate 作者: gait-cycle 時間: 2025-3-22 17:59 作者: Toxoid-Vaccines 時間: 2025-3-22 23:19
Parameterized Complexity of , of Caterpillars and ,roblem, we introduce the . problem: given a vertex-weighted path . and integer ., decide if there exists a mapping of the vertices of . to a path ., such that adjacent vertices are mapped to adjacent or equal vertices, and such that the total weight of the pre-image of a vertex from . equals an inte作者: MOT 時間: 2025-3-23 05:07 作者: 粗俗人 時間: 2025-3-23 09:02 作者: 消息靈通 時間: 2025-3-23 13:40
,On the Parameterized Complexity of the Connected Flow and Many Visits?TSP Problem,emand vertices . with demands ., and costs and capacities for each edge. The goal is to find a minimum cost flow that satisfies the demands, respects the capacities and induces a (strongly) connected subgraph. This generalizes previously studied problems like the ...We study the parameterized comple作者: 厚臉皮 時間: 2025-3-23 17:16 作者: 不舒服 時間: 2025-3-23 19:35
Disjoint Stable Matchings in Linear Time,cal results: .Moreover, we also give an algorithm to enumerate all maximum-length chains of disjoint stable matchings in the lattice of stable matchings of a given instance. This algorithm takes time polynomial in the input size for enumerating each chain. We also derive the expected number of such 作者: 輕快走過 時間: 2025-3-23 22:18 作者: 恭維 時間: 2025-3-24 05:32
On Subgraph Complementation to ,-free Graphs,duced by . in . results in a graph in .. We investigate the complexity of the problem when . is .-free for . being a complete graph, a star, a path, or a cycle. We obtain the following results:.Further, we prove that these hard problems do not admit subexponential-time algorithms (algorithms running作者: 難取悅 時間: 2025-3-24 08:19 作者: ANA 時間: 2025-3-24 14:46
Preventing Small ,-Cuts by Protecting Edges,of total cost at most?. such that?. has no?(.,?.)-edge cut of capacity at most?. that is disjoint from?.. We show that . (.,?.). is NP-hard even on subcubcic graphs when all edges have capacity and cost one and provide a comprehensive study of the parameterized complexity of the problem. We show, fo作者: 合群 時間: 2025-3-24 16:22 作者: Ancestor 時間: 2025-3-24 21:36 作者: 充滿裝飾 時間: 2025-3-25 00:01
The Perfect Matching Cut Problem Revisited,ching cut, and is known to be .-complete. We revisit the problem and show that . remains .-complete when restricted to bipartite graphs of maximum degree?3 and arbitrarily large girth. Complementing this hardness result, we give two graph classes in which . is polynomial time solvable. The first one作者: Awning 時間: 2025-3-25 05:32
The Complexity of Gerrymandering over Graphs: Paths and Trees,any districts as possible. While typically studied from a geographical point of view, addressing social network structures, the investigation of gerrymandering over graphs was recently initiated by Cohen-Zemach et al.?[AAMAS?2018]. Settling three open questions of Ito et al.?[AAMAS?2019, TCS?2021], 作者: 纖細 時間: 2025-3-25 09:51
Feedback Vertex Set on Hamiltonian Graphs,planar and regular. Moreover, we study the less known class of?.-Hamiltonian-ordered graphs, which are graphs that admit for any .-tuple of vertices a Hamiltonian cycle visiting them in the order given by the tuple. We prove that . remains .-hard in these restricted cases, even if a Hamiltonian cycl作者: infringe 時間: 2025-3-25 13:13
Towards Classifying the Polynomial-Time Solvability of Temporal Betweenness Centrality,rtices. Betweenness centrality is efficiently computable and it is a fundamental tool in network science. Continuing and extending previous work, we study the efficient computability of betweenness centrality in . graphs (graphs with fixed vertex set but time-varying arc sets). Unlike in the static 作者: 善辯 時間: 2025-3-25 18:33 作者: 休息 時間: 2025-3-25 23:57
Linearizable Special Cases of the Quadratic Shortest Path Problem, sum of the interaction costs over all pairs of arcs on the path is minimized. We consider special cases of the QSPP that are linearizable as a shortest path problem in the sense of Bookhold. If the QSPP on a directed graph is linearizable under all possible choices of the arc interaction costs, the作者: 庇護 時間: 2025-3-26 03:47 作者: Coma704 時間: 2025-3-26 08:11 作者: 宮殿般 時間: 2025-3-26 10:34
Biophysics for the Life Sciencesains all graphs whose blocks belong to . and the class . contains all graphs where the removal of a vertex creates a graph in .. Given a hereditary graph class ., we recursively define . so that . and, if ., .. The . of a graph . to a graph class . is the minimum . such that . and can be seen as an 作者: 寡頭政治 時間: 2025-3-26 15:53
https://doi.org/10.1007/978-1-4612-5166-8d coverage requirements ., the goal is to find a minimum-sized set of vertices that are incident on at least . edges of color ., for each ., i.e., we need to cover at least . edges of color .. . is similar to . except here we are given a vertex-colored graph and the goal is to cover at least . verti作者: Exposition 時間: 2025-3-26 18:07 作者: Herpetologist 時間: 2025-3-26 23:10
https://doi.org/10.1007/978-3-319-08714-6g one vertex from each connected component in each round. The .-treewidth of a graph?. is the minimum, taken over all vertex sets?. for which each connected component of?. belongs to?., of the treewidth of the graph obtained from?. by replacing the neighborhood of each component of?. by a clique and作者: STYX 時間: 2025-3-27 02:22
https://doi.org/10.1007/978-94-011-2108-8cal results: .Moreover, we also give an algorithm to enumerate all maximum-length chains of disjoint stable matchings in the lattice of stable matchings of a given instance. This algorithm takes time polynomial in the input size for enumerating each chain. We also derive the expected number of such 作者: 逗它小傻瓜 時間: 2025-3-27 05:18
https://doi.org/10.1007/978-3-662-29084-2g t-perfect graphs started immediately, but embarrassingly, even a working conjecture on it is still missing after nearly 50 years. Unlike perfection, t-perfection is not closed under substitution or complementation. A full characterization of t-perfection with respect to substitution has been obtai作者: 抱負 時間: 2025-3-27 12:06 作者: Incumbent 時間: 2025-3-27 17:25
https://doi.org/10.1007/978-3-031-36882-0m takes an undirected graph . and a non-negative integer . as input, and the objective is to test if . has an oct of size at most .. The directed counterpart of the problem, . (DOCT), where the input is a digraph and ., is defined analogously. When parameterized by ., OCT is known to be . [Reed et a作者: Schlemms-Canal 時間: 2025-3-27 21:04
Molecular Communications and Nanonetworksof total cost at most?. such that?. has no?(.,?.)-edge cut of capacity at most?. that is disjoint from?.. We show that . (.,?.). is NP-hard even on subcubcic graphs when all edges have capacity and cost one and provide a comprehensive study of the parameterized complexity of the problem. We show, fo作者: 值得 時間: 2025-3-27 22:13 作者: Cubicle 時間: 2025-3-28 02:54 作者: intellect 時間: 2025-3-28 09:50 作者: 異常 時間: 2025-3-28 12:39
John A. A. Sillince,Maria Sillinceany districts as possible. While typically studied from a geographical point of view, addressing social network structures, the investigation of gerrymandering over graphs was recently initiated by Cohen-Zemach et al.?[AAMAS?2018]. Settling three open questions of Ito et al.?[AAMAS?2019, TCS?2021], 作者: 百靈鳥 時間: 2025-3-28 17:44
https://doi.org/10.1007/978-1-4419-7130-2planar and regular. Moreover, we study the less known class of?.-Hamiltonian-ordered graphs, which are graphs that admit for any .-tuple of vertices a Hamiltonian cycle visiting them in the order given by the tuple. We prove that . remains .-hard in these restricted cases, even if a Hamiltonian cycl作者: CANDY 時間: 2025-3-28 18:51
Molecular Design of Tautomeric Compoundsrtices. Betweenness centrality is efficiently computable and it is a fundamental tool in network science. Continuing and extending previous work, we study the efficient computability of betweenness centrality in . graphs (graphs with fixed vertex set but time-varying arc sets). Unlike in the static 作者: defile 時間: 2025-3-29 01:06 作者: gregarious 時間: 2025-3-29 03:04 作者: 不成比例 時間: 2025-3-29 10:49
Graph-Theoretic Concepts in Computer Science978-3-030-86838-3Series ISSN 0302-9743 Series E-ISSN 1611-3349 作者: 侵略主義 時間: 2025-3-29 13:17 作者: Herpetologist 時間: 2025-3-29 16:17
https://doi.org/10.1007/978-1-4419-7130-2planar and regular. Moreover, we study the less known class of?.-Hamiltonian-ordered graphs, which are graphs that admit for any .-tuple of vertices a Hamiltonian cycle visiting them in the order given by the tuple. We prove that . remains .-hard in these restricted cases, even if a Hamiltonian cycle is additionally given as part of the input.作者: AROMA 時間: 2025-3-29 23:44 作者: Abjure 時間: 2025-3-30 02:13 作者: evasive 時間: 2025-3-30 04:42 作者: 注意到 時間: 2025-3-30 10:12
The Dynamic Complexity of Acyclic Hypergraph Homomorphisms,show that an answer to this problem can be maintained under single-edge changes of ., as long as it stays acyclic, in the . framework of Patnaik and Immerman that uses updates expressed in first-order logic. If additionally also changes of . are allowed, we show that it is unlikely that existence of homomorphisms can be maintained in ..作者: Excise 時間: 2025-3-30 13:36
,On the Parameterized Complexity of the Connected Flow and Many Visits?TSP Problem,the capacities and induces a (strongly) connected subgraph. This generalizes previously studied problems like the ...We study the parameterized complexity of . parameterized by |.|, the treewidth . and by vertex cover size . of . and provide: .To achieve some of our results, we significantly extend an approach by Kowalik et al.?[ESA’20].作者: 特征 時間: 2025-3-30 16:58 作者: Confess 時間: 2025-3-30 23:41 作者: 小淡水魚 時間: 2025-3-31 01:24
https://doi.org/10.1007/978-3-211-99699-7or finding separators, a separator minimization method for a refinement of found separators, and a refinement of an obtained treedepth decomposition by merging techniques of tree rotations. This approach enables us to quickly obtain low-depth decompositions of very large graphs.作者: acolyte 時間: 2025-3-31 09:00
Barbara Ann Hamkalo,John Papaconstantinounential Time Hypothesis, we show there is no .-time algorithm for . even when restricted to .-vertex bipartite graphs, and also show that . can be solved in . time by means of an exact branching algorithm.作者: faddish 時間: 2025-3-31 11:32 作者: vertebrate 時間: 2025-3-31 14:47 作者: peritonitis 時間: 2025-3-31 18:45 作者: BLAND 時間: 2025-3-31 22:06 作者: OASIS 時間: 2025-4-1 03:27
The Perfect Matching Cut Problem Revisited,nential Time Hypothesis, we show there is no .-time algorithm for . even when restricted to .-vertex bipartite graphs, and also show that . can be solved in . time by means of an exact branching algorithm.作者: neolith 時間: 2025-4-1 07:56
The Complexity of Gerrymandering over Graphs: Paths and Trees, (that is, worst-case hardness), in particular yield two complexity dichotomies for trees. For instance, the problem is polynomial-time solvable for two parties but becomes weakly NP-hard for three. Moreover, we show that the problem remains NP-hard even when the input graph is a path.作者: DOTE 時間: 2025-4-1 10:55 作者: morale 時間: 2025-4-1 16:42
https://doi.org/10.1007/978-3-319-08714-6ractable algorithms for testing whether the .-elimination distance or .-treewidth of a graph is at most?.. Along the way, we also provide such algorithms for all graph classes?. defined by a finite set of forbidden induced subgraphs.
