書目名稱Graph-Theoretic Concepts in Computer Science影響因子(影響力)學科排名
書目名稱Graph-Theoretic Concepts in Computer Science網(wǎng)絡(luò)公開度
書目名稱Graph-Theoretic Concepts in Computer Science網(wǎng)絡(luò)公開度學科排名
書目名稱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-22 00:17 作者: periodontitis 時間: 2025-3-22 02:31
https://doi.org/10.1007/978-981-10-4511-0 for .. As a byproduct, we give the first known polynomial-time recognition algorithm for 6-leaf powers. Our work combines several new algorithmic ideas that help us overcome the previous limitations on the usual dynamic programming approach for these problems.作者: triptans 時間: 2025-3-22 04:44 作者: 元音 時間: 2025-3-22 09:28 作者: 僵硬 時間: 2025-3-22 13:24 作者: 僵硬 時間: 2025-3-22 18:27
Molecular Diagnostics for Dermatologyptotically optimal, under the exponential-time hypothesis (ETH)..The results extend the range of tractability of the . problem, showing that it is fixed-parameter tractable when parameterized below a natural bound. In addition, for the first parameterization we show that a kernel with .(.) vertices can be found in polynomial time.作者: 來就得意 時間: 2025-3-23 00:33 作者: Malfunction 時間: 2025-3-23 03:47 作者: vitreous-humor 時間: 2025-3-23 05:32
Maximiliano Nardelli,Juan Ignacio Túneza fully-polynomial time approximation scheme (FPTAS). We also prove that STP is weakly .-hard for these restricted graphs. For TSP we show .-hardness for graphs of highway dimension?6, which answers an open problem posed in [Feldmann?et al.?ICALP?2015].作者: Malleable 時間: 2025-3-23 10:24 作者: audiologist 時間: 2025-3-23 16:32
,Hamiltonicity Below Dirac’s Condition,ptotically optimal, under the exponential-time hypothesis (ETH)..The results extend the range of tractability of the . problem, showing that it is fixed-parameter tractable when parameterized below a natural bound. In addition, for the first parameterization we show that a kernel with .(.) vertices can be found in polynomial time.作者: 預防注射 時間: 2025-3-23 21:03 作者: peritonitis 時間: 2025-3-24 01:58
,Fixed-Parameter Tractability of Counting Small Minimum (,,?,)-Cuts,’s theorem, allows us to build the algorithm counting all minimum (.,?.)-cuts with running time .. Initially dedicated to counting minimum cuts, it can be modified to obtain an FPT sampling of minimum edge (.,?.)-cuts.作者: 燒烤 時間: 2025-3-24 05:03
Travelling on Graphs with Small Highway Dimension,a fully-polynomial time approximation scheme (FPTAS). We also prove that STP is weakly .-hard for these restricted graphs. For TSP we show .-hardness for graphs of highway dimension?6, which answers an open problem posed in [Feldmann?et al.?ICALP?2015].作者: FRET 時間: 2025-3-24 09:10
Approximating Minimum Dominating Set on String Graphs, we also provide an 8-approximation for the . problem for the . L-., intersection graphs of .-paths intersecting a common vertical line. The same problem is known to be APX-Hard (MFCS, 2018). As a by-product of our proof, we obtained a 2-approximation algorithm for the . (.) problem introduced and studied by Katz et al. (Comput. Geom. 2005).作者: 打折 時間: 2025-3-24 10:57
Philip M. Dean,Richard A. Lewisubgraph-free graph, using as parameter the vertex-deletion distance to treewidth ., where . denotes the minimum treewidth of the graphs in .. For the other case, where . contains a .-subgraph-free graph, we present a polynomial Turing kernelization. Our results extend to .-.-..作者: 猛擊 時間: 2025-3-24 16:31
https://doi.org/10.1007/978-1-349-11044-5 the flip distance between graph orientations in which every cycle has a specified number of forward edges, and a flip is the reversal of all edges in a minimal directed cut. In general, the problem remains hard, but if we only change sinks into sources, or vice-versa, then the problem can be solved in polynomial time.作者: –scent 時間: 2025-3-24 20:08 作者: subordinate 時間: 2025-3-25 02:28 作者: 講個故事逗他 時間: 2025-3-25 04:22
https://doi.org/10.1385/1592599281 provide a complete dichotomy for the problem: if . has no two vertices sharing two common neighbors, then the problem can be solved in time ., otherwise there is no algorithm working in time ., even in intersection graphs of segments, unless the ETH fails. This generalizes several known results con作者: legislate 時間: 2025-3-25 07:38
https://doi.org/10.1007/978-981-10-4511-0ubgraph of the .-power of some tree .. In particular, . is a . . if all vertices in .(.) are leaf-nodes of .. Our main contribution is a polynomial-time recognition algorithm of 4-Steiner powers, thereby extending the decade-year-old results of (Lin, Kearney and Jiang, .) for . and (Chang and Ko, .)作者: flavonoids 時間: 2025-3-25 12:42 作者: Phagocytes 時間: 2025-3-25 16:42
Molecular Diagnostics in Cancer Patientss well-known that a necessary condition for . to be tractable in such a class (unless P?=?NP) is that the set of forbidden induced subgraphs includes a subdivided star ., for some .. Here, . is the graph obtained by taking three paths of length . and identifying one of their endpoints..It is an inte作者: 黃油沒有 時間: 2025-3-25 22:26
Molecular Diagnostics in Cytopathologyranch decomposition. It was introduced by Norine and intended as a tool for the structural study of matching covered graphs, especially in the context of Pfaffian orientations. Norine conjectured that graphs of high perfect matching width contain a large grid as a matching minor, similar to the resu作者: 思想 時間: 2025-3-26 01:09
Molecular Diagnostics of Cancerg each vertex choose its side of the cut uniformly at random. This does not require any communication and achieves an approximation ratio of at least . in average. When the graph is .-regular and triangle-free, a slightly better approximation ratio can be achieved with a randomized algorithm running作者: Irritate 時間: 2025-3-26 07:43 作者: Intellectual 時間: 2025-3-26 09:27
Philip M. Dean,Richard A. Lewisst . such that . is .-minor-free. For . and . this encodes . and . respectively. When parameterized by the feedback vertex number of . these two problems are known to admit a polynomial kernelization. Such a polynomial kernelization also exists for any . containing a planar graph but no forests..In 作者: 激怒 時間: 2025-3-26 16:08
https://doi.org/10.1007/978-1-349-11044-5 computational problem to consider is the flip distance: Given two objects, what is the minimum number of flips needed to transform one into the other?.We consider flip graphs on so-called .-orientations of a graph ., in which every vertex . has a specified outdegree ., and a flip consists of revers作者: Predigest 時間: 2025-3-26 18:53 作者: Jocose 時間: 2025-3-26 23:38
https://doi.org/10.1007/978-3-030-88500-7cond problem gives a natural generalization of ., which is the complement of the classical . problem. Due to their fundamental role in theory and practice, clusterization and cut problems has always attracted a lot of attention. We establish a new connection between these two classes of problems by 作者: Canyon 時間: 2025-3-27 03:02
https://doi.org/10.1007/978-981-97-1699-9ing tokens remain a matching. The . between two configurations of tokens is the minimum number of moves required to transform one into the other. We study the problem of computing the distance between two given configurations. We prove that if source and target configurations are maximal matchings, 作者: Allodynia 時間: 2025-3-27 08:40
Maximiliano Nardelli,Juan Ignacio Túnezy Abraham et al.?[SODA?2010] as a model for transportation networks, on which TSP and STP naturally occur for various applications in logistics. It was previously shown [Feldmann?et al.?ICALP?2015] that these problems admit a quasi-polynomial time approximation scheme (QPTAS) on graphs of constant h作者: 鐵塔等 時間: 2025-3-27 11:34
Molecular Ecology of Aquatic Communitieshether . contains a set of pairwise edge-disjoint paths connecting every terminal pair in .. Our aim is to identify structural properties (parameters) of graphs which allow the efficient solution of EDP without restricting the placement of terminals in . in any way. In this setting, EDP is known to 作者: Isthmus 時間: 2025-3-27 16:41
https://doi.org/10.1007/978-1-4615-7482-8tudy the following problem. Given a graph ., together with a set of relationships between pairs of edges, each specifying that an edge must be longer than another edge, is it possible to construct a straight-line drawing of . satisfying all these relationships?.We mainly consider a dichotomous setti作者: 繁榮中國 時間: 2025-3-27 20:52 作者: 供過于求 時間: 2025-3-27 22:45
https://doi.org/10.1007/978-1-4615-8532-9hbors in ., possibly involving ties, and each vertex can have capacities and classifications. A classification . for a vertex . is a collection of subsets of neighbors of .. Each subset (class) . has an . denoting the maximum number of vertices from . that can be matched to .. The goal is to find a 作者: 不利 時間: 2025-3-28 04:50 作者: Benzodiazepines 時間: 2025-3-28 09:40
The 4-Steiner Root Problem,ubgraph of the .-power of some tree .. In particular, . is a . . if all vertices in .(.) are leaf-nodes of .. Our main contribution is a polynomial-time recognition algorithm of 4-Steiner powers, thereby extending the decade-year-old results of (Lin, Kearney and Jiang, .) for . and (Chang and Ko, .)作者: SEVER 時間: 2025-3-28 14:29
,Hamiltonicity Below Dirac’s Condition,2. Both the value ./2 and the requirement for . to have high degree are necessary for the theorem to hold..In this work we give efficient algorithms for determining Hamiltonicity when either of the two conditions are relaxed. More precisely, we show that the . problem can be solved in time ., for a 作者: Picks-Disease 時間: 2025-3-28 18:23 作者: Triglyceride 時間: 2025-3-28 21:42
Cyclewidth and the Grid Theorem for Perfect Matching Width of Bipartite Graphs,ranch decomposition. It was introduced by Norine and intended as a tool for the structural study of matching covered graphs, especially in the context of Pfaffian orientations. Norine conjectured that graphs of high perfect matching width contain a large grid as a matching minor, similar to the resu作者: preeclampsia 時間: 2025-3-29 00:47
Local Approximation of the Maximum Cut in Regular Graphs,g each vertex choose its side of the cut uniformly at random. This does not require any communication and achieves an approximation ratio of at least . in average. When the graph is .-regular and triangle-free, a slightly better approximation ratio can be achieved with a randomized algorithm running作者: hauteur 時間: 2025-3-29 04:58 作者: 使激動 時間: 2025-3-29 09:02
A Turing Kernelization Dichotomy for Structural Parameterizations of ,-Minor-Free Deletion,st . such that . is .-minor-free. For . and . this encodes . and . respectively. When parameterized by the feedback vertex number of . these two problems are known to admit a polynomial kernelization. Such a polynomial kernelization also exists for any . containing a planar graph but no forests..In 作者: 油氈 時間: 2025-3-29 14:39 作者: follicular-unit 時間: 2025-3-29 16:36
Graph Functionality,acy or clique-width, in the sense that bounded degeneracy or bounded clique-width imply bounded functionality. Moreover, we show that this generalization is proper by revealing classes of graphs of unbounded degeneracy and clique-width, where functionality is bounded by a constant. We also prove tha作者: 單片眼鏡 時間: 2025-3-29 21:49
On Happy Colorings, Cuts, and Structural Parameterizations,cond problem gives a natural generalization of ., which is the complement of the classical . problem. Due to their fundamental role in theory and practice, clusterization and cut problems has always attracted a lot of attention. We establish a new connection between these two classes of problems by 作者: bacteria 時間: 2025-3-30 01:58 作者: 子女 時間: 2025-3-30 05:51 作者: 菊花 時間: 2025-3-30 11:31
The Power of Cut-Based Parameters for Computing Edge Disjoint Paths,hether . contains a set of pairwise edge-disjoint paths connecting every terminal pair in .. Our aim is to identify structural properties (parameters) of graphs which allow the efficient solution of EDP without restricting the placement of terminals in . in any way. In this setting, EDP is known to 作者: quiet-sleep 時間: 2025-3-30 16:13 作者: Bronchial-Tubes 時間: 2025-3-30 16:56 作者: decipher 時間: 2025-3-30 22:31
,Classified Rank-Maximal Matchings and Popular Matchings – Algorithms and Hardness,hbors in ., possibly involving ties, and each vertex can have capacities and classifications. A classification . for a vertex . is a collection of subsets of neighbors of .. Each subset (class) . has an . denoting the maximum number of vertices from . that can be matched to .. The goal is to find a 作者: 牽連 時間: 2025-3-31 03:09
https://doi.org/10.1385/1592599281orphism, defined analogously, the situation seems more complicated. We show the dichotomy theorem for simple connected graphs . with maximum degree 2. If . is isomorphic to . or ., then the existence of a locally surjective homomorphism from a string graph with . vertices to . can be decided in time作者: 尖 時間: 2025-3-31 07:20
Molecular Diagnostics in Cancer Patientsis result by showing that the problem remains tractable on .-free graphs, for any fixed .. Along the way, we show that subcubic . is tractable for graphs excluding a type of graph we call an “apple with a long stem”, generalizing known results for apple-free graphs.作者: CLIFF 時間: 2025-3-31 11:56
Molecular Diagnostics of Cancern several ways, and in particular no deterministic algorithm with approximation ratio . (with .) can run in a constant number of rounds. We also prove results of a similar flavour for the . problem in regular oriented graphs, where we want to maximize the number of arcs oriented from the left part t作者: 痛苦一下 時間: 2025-3-31 15:54 作者: GIST 時間: 2025-3-31 17:30
Molecular Ecology of Aquatic Communities on every graph class of bounded treecut width. Our second result shows that EDP parameterized by treecut width is unlikely to be fixed-parameter tractable. Our final, third result is a polynomial kernel for EDP parameterized by the size of a minimum feedback edge set in the graph.作者: 神圣將軍 時間: 2025-3-31 21:45
https://doi.org/10.1007/978-1-4615-7482-8ve instances, even when the input graph is composed of a maximal planar graph, namely a double-wheel graph, and an edge. We conjecture that planar graphs always admit a (not necessarily planar) realization in the dichotomous setting.作者: 巫婆 時間: 2025-4-1 05:51
https://doi.org/10.1007/978-1-4615-8532-9ent this with an .-hardness result when classes are non-laminar even under strict preference lists, and even when only posts have classifications, and each applicant has a quota of one. We show an analogous dichotomy result for computing a popular matching amongst feasible matchings (if one exists)
