書目名稱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é)科排名
作者: sigmoid-colon 時(shí)間: 2025-3-21 23:12 作者: 隨意 時(shí)間: 2025-3-22 01:20 作者: Infusion 時(shí)間: 2025-3-22 08:22
https://doi.org/10.1057/9780230206069every group is represented up to an extent proportional to the final selection size. Matching with proportional fairness or more commonly, proportionally fair matching, was introduced in [Chierichetti et al., AISTATS, 2019]. In this problem, we are given a graph . whose edges are colored with colors作者: circuit 時(shí)間: 2025-3-22 09:57 作者: Decrepit 時(shí)間: 2025-3-22 15:01
https://doi.org/10.1007/978-1-349-16765-4hwidth at most 1. The problem . (.) asks whether such a graph can be obtained using at most . vertex explosions, where a . replaces a vertex . by . degree-1 vertices, each incident to exactly one edge that was originally incident to?.. For ., we give an FPT algorithm with running time . and an . ker作者: Decrepit 時(shí)間: 2025-3-22 19:48
https://doi.org/10.1007/978-981-99-2485-1even induced subgraphs, or into an odd and an even induced subgraph. We refer to a partition into odd subgraphs as an . of .. Scott [Graphs and Combinatorics, 2001] proved that a graph admits an odd colouring if and only if it has an even number of vertices. We say that a graph . is .-odd colourable作者: 茁壯成長(zhǎng) 時(shí)間: 2025-3-23 00:17
https://doi.org/10.1007/978-1-349-22971-0contains at least . pairwise vertex-disjoint copies of . as (butterfly) minor, or there exists a subset . of at most .(.) vertices such that . is not a (butterfly) minor of .. It is a well known result of Robertson and Seymour that an undirected graph has the EP property if and only if it is planar.作者: Organization 時(shí)間: 2025-3-23 02:59 作者: 罵人有污點(diǎn) 時(shí)間: 2025-3-23 06:40 作者: Expurgate 時(shí)間: 2025-3-23 11:56 作者: GILD 時(shí)間: 2025-3-23 16:44
https://doi.org/10.1057/9780230372467ng algorithmic problem, ., is known to be NP-complete in subcubic bipartite graphs [Le & Telle, TCS ’22] but its complexity was open in planar graphs and in cubic graphs. We settle both questions at once by showing that . is NP-complete in 3-connected cubic bipartite planar graphs or .. Prior to our作者: white-matter 時(shí)間: 2025-3-23 18:15 作者: 神圣不可 時(shí)間: 2025-3-24 01:28 作者: sultry 時(shí)間: 2025-3-24 05:43
Modern Latin America Since 1800 algorithms often find themselves doing a meticulous analysis of numerous different cases in order to identify these structures and design suitable branching rules, all done by hand. This process tends to be error prone and often the resulting algorithm may be difficult to implement in practice..In 作者: Flirtatious 時(shí)間: 2025-3-24 08:06
https://doi.org/10.1007/978-1-4614-6943-8a bag of a tree-cut decomposition. They are motivated by edge-cut width, recently introduced by Brand et al. (WG 2022). We show that edge-crossing width is equivalent to the known parameter tree-partition-width. On the other hand, .-edge-crossing width is a new parameter; tree-cut width and .-edge-c作者: Grasping 時(shí)間: 2025-3-24 14:33
https://doi.org/10.1007/978-94-015-0770-7e rest of . via its four cornerpoints. We prove that if all the ladders contained in . are reduced to length 4, the treewidth remains unchanged (and that this bound is tight). Our result indicates that, when computing the treewidth of a graph, long ladders can simply be reduced, and that minimal for作者: Progesterone 時(shí)間: 2025-3-24 15:53
., . asks whether . has an acyclic matching of . (i.e., the number of edges) at least .. In this paper, we first prove that assuming ., there does not exist any .-approximation algorithm for . that approximates it within a constant factor when parameterized by .. Our reduction is general in the sens作者: 薄荷醇 時(shí)間: 2025-3-24 19:00
https://doi.org/10.1007/b137490 . satisfies property .. For example, if the property . is that of being a matching, being acyclic, or being disconnected, then we obtain an ., an ., and a ., respectively. In this paper, we analyze the problems of the computation of these matchings from the viewpoint of Parameterized Complexity wit作者: lavish 時(shí)間: 2025-3-25 02:08
Reference work 2018Latest editionstances to the vertices of the pair are distinct. This problem has mainly been studied on undirected graphs and has gained a lot of attention in the recent years. We focus on directed graphs, and show how to solve the problem in linear-time on digraphs whose underlying undirected graph (ignoring mul作者: REIGN 時(shí)間: 2025-3-25 07:21 作者: 量被毀壞 時(shí)間: 2025-3-25 08:26
https://doi.org/10.1007/978-3-319-28275-6minimum number of independent sets, each of total size at most 1. Being a generalization of the notoriously hard graph coloring problem, BPC has been studied mostly on polynomially colorable conflict graphs. An intriguing open question is whether BPC on such graphs admits the same best known approxi作者: ADAGE 時(shí)間: 2025-3-25 15:15 作者: 責(zé)難 時(shí)間: 2025-3-25 19:38
,Reconstructing Graphs from?Connected Triples, form a connected subgraph. In general, different (labelled) graphs may have the same set of connected triples, making unique reconstruction of the original graph from the triples impossible. We identify some families of graphs (including triangle-free graphs) for which all graphs have a different s作者: BIDE 時(shí)間: 2025-3-26 00:04
,Parameterized Complexity of?Vertex Splitting to?Pathwidth at?Most 1,hwidth at most 1. The problem . (.) asks whether such a graph can be obtained using at most . vertex explosions, where a . replaces a vertex . by . degree-1 vertices, each incident to exactly one edge that was originally incident to?.. For ., we give an FPT algorithm with running time . and an . ker作者: 說不出 時(shí)間: 2025-3-26 03:24 作者: 集中營(yíng) 時(shí)間: 2025-3-26 04:43 作者: anthesis 時(shí)間: 2025-3-26 11:36
,New Width Parameters for?Independent Set: One-Sided-Mim-Width and?Neighbor-Depth,eter that is as general as possible and allows to solve independent set in polynomial-time on graphs where the parameter is bounded. We introduce two new graph width parameters: one-sided maximum induced matching-width (o-mim-width) and neighbor-depth. O-mim-width is a graph parameter that is more g作者: macrophage 時(shí)間: 2025-3-26 15:57
,Nonplanar Graph Drawings with , Vertices per?Face,n increasing attention in the last two decades, under the name of .. In this context, we introduce a new hierarchy of graph families, called .-.. For any integer ., a graph . is a .-real face graph if it admits a drawing . in the plane such that the boundary of each face (formed by vertices, crossin作者: etiquette 時(shí)間: 2025-3-26 19:18 作者: 騙子 時(shí)間: 2025-3-26 23:39 作者: galley 時(shí)間: 2025-3-27 01:31 作者: Tdd526 時(shí)間: 2025-3-27 05:45 作者: bioavailability 時(shí)間: 2025-3-27 12:29 作者: Maximize 時(shí)間: 2025-3-27 14:24 作者: 職業(yè) 時(shí)間: 2025-3-27 20:43 作者: Ballerina 時(shí)間: 2025-3-28 01:34
,Parameterized Results on?Acyclic Matchings with?Implications for?Related Problems,., . asks whether . has an acyclic matching of . (i.e., the number of edges) at least .. In this paper, we first prove that assuming ., there does not exist any .-approximation algorithm for . that approximates it within a constant factor when parameterized by .. Our reduction is general in the sens作者: 磨碎 時(shí)間: 2025-3-28 04:05 作者: 使人煩燥 時(shí)間: 2025-3-28 08:38 作者: Exclaim 時(shí)間: 2025-3-28 13:57
,Degreewidth: A New Parameter for?Solving Problems on?Tournaments,lic. The degreewidth of a tournament . denoted by . is the minimum value . for which we can find an ordering . of the vertices of . such that every vertex is incident to at most . backward arcs (. an arc . such that .). Thus, a tournament is acyclic if and only if its degreewidth is zero. Additional作者: dapper 時(shí)間: 2025-3-28 15:00 作者: opalescence 時(shí)間: 2025-3-28 20:22 作者: Intuitive 時(shí)間: 2025-3-29 00:21
idth and sim-width, have the limitation that no algorithms are known to compute bounded-width decompositions in polynomial-time. To partially resolve this limitation, we introduce the parameter neighbor-depth. We show that given a graph of neighbor-depth ., independent set can be solved in time . ev作者: Habituate 時(shí)間: 2025-3-29 07:08
https://doi.org/10.1057/9780230604841e definition - the graphs are mixed (they may have both directed and undirected edges), may have multiple edges, loops, and semi-edges. We show that a strong P/NP-co dichotomy holds true in the sense that for each such fixed target graph ., the .-. problem is either polynomial time solvable for arbi作者: Morose 時(shí)間: 2025-3-29 08:40
https://doi.org/10.1007/978-1-4614-6943-8zed by .-edge-crossing width. They were known to be W[1]-hard parameterized by tree-partition-width, and FPT parameterized by edge-cut width, and we close the complexity gap between these two parameters.作者: 等待 時(shí)間: 2025-3-29 14:33
https://doi.org/10.1007/978-3-319-28275-6s, a 2.445-approximation for perfect graphs, and a .-approximation for split graphs. To this end, we introduce a generic framework relying on a novel interpretation of BPC allowing us to solve the problem via . techniques. Our framework may find use in tackling BPC on other graph classes arising in 作者: ATRIA 時(shí)間: 2025-3-29 19:05 作者: Cacophonous 時(shí)間: 2025-3-29 22:16 作者: 值得尊敬 時(shí)間: 2025-3-30 00:22
,Computational Complexity of?Covering Colored Mixed Multigraphs with?Degree Partition Equivalence Cle definition - the graphs are mixed (they may have both directed and undirected edges), may have multiple edges, loops, and semi-edges. We show that a strong P/NP-co dichotomy holds true in the sense that for each such fixed target graph ., the .-. problem is either polynomial time solvable for arbi作者: indignant 時(shí)間: 2025-3-30 05:09 作者: 咒語 時(shí)間: 2025-3-30 08:14 作者: 暗諷 時(shí)間: 2025-3-30 14:15
Modern Islamic Investment Managementet of connected triples. We also give algorithms that reconstruct a graph from a set of triples, and for testing if this reconstruction is unique. Finally, we study a possible extension of the model in which the subsets of size . that induce a connected graph are given for larger (fixed) values of ..作者: lipoatrophy 時(shí)間: 2025-3-30 17:17
Modern Language, Philosophy and Criticismecisely, we consider .-connected chordal graphs and a broader class of graphs related to them. For the first class, we give an algorithm with . running time that solves the problem exactly, and for the second, an algorithm with . running time that deviates on at most one vertex from the required vertex partition sizes.作者: 搖晃 時(shí)間: 2025-3-30 21:26 作者: QUAIL 時(shí)間: 2025-3-31 02:20
,Reconstructing Graphs from?Connected Triples,et of connected triples. We also give algorithms that reconstruct a graph from a set of triples, and for testing if this reconstruction is unique. Finally, we study a possible extension of the model in which the subsets of size . that induce a connected graph are given for larger (fixed) values of ..作者: ECG769 時(shí)間: 2025-3-31 08:08 作者: 盤旋 時(shí)間: 2025-3-31 09:35 作者: Frenetic 時(shí)間: 2025-3-31 15:41
https://doi.org/10.1057/9780230372467and in cubic graphs. We settle both questions at once by showing that . is NP-complete in 3-connected cubic bipartite planar graphs or .. Prior to our work, among problems whose input is solely an undirected graph, only . was known NP-complete in Barnette graphs. Notably, . would only join this private club if Barnette’s conjecture were refuted.作者: milligram 時(shí)間: 2025-3-31 18:31
https://doi.org/10.1007/978-1-349-22971-0is the minor of some grid, not all planar digraphs are butterfly minors of a cylindrical grid. In this work, we characterize the planar digraphs that have a butterfly model in a cylindrical grid. In particular, this leads to a linear-time algorithm that decides whether a weakly 3-connected strong digraph has the EP property.作者: Bouquet 時(shí)間: 2025-4-1 01:28
https://doi.org/10.1007/978-1-4684-6488-7he boundary of the external face, then .-real face and .-real face graphs have at most . and . edges, respectively. We also study relationships between .-real face graphs and beyond-planar graph families with hereditary property.作者: 枕墊 時(shí)間: 2025-4-1 02:37
Modern Latin America Since 1800s of the graph, such that their deletion results in a graph not containing a path on . vertices as a subgraph. We develop a fully automated framework to generate parameterized branching algorithms for the problem and obtain algorithms outperforming those previously known for ., e.g., we show that 5-PVC can be solved in . time.作者: 粗鄙的人 時(shí)間: 2025-4-1 06:33 作者: 責(zé)怪 時(shí)間: 2025-4-1 10:09
,Deciding the?Erd?s-Pósa Property in?3-Connected Digraphs,is the minor of some grid, not all planar digraphs are butterfly minors of a cylindrical grid. In this work, we characterize the planar digraphs that have a butterfly model in a cylindrical grid. In particular, this leads to a linear-time algorithm that decides whether a weakly 3-connected strong digraph has the EP property.作者: 無畏 時(shí)間: 2025-4-1 15:31
,Nonplanar Graph Drawings with , Vertices per?Face,he boundary of the external face, then .-real face and .-real face graphs have at most . and . edges, respectively. We also study relationships between .-real face graphs and beyond-planar graph families with hereditary property.
