作者: 構(gòu)想 時(shí)間: 2025-3-21 22:37 作者: Affluence 時(shí)間: 2025-3-22 03:11 作者: 名字的誤用 時(shí)間: 2025-3-22 05:24
,On the?Minimum Cycle Cover Problem on?Graphs with?Bounded Co-degeneracy,id to be .-stable if for any graph . of order . that does not satisfy ., the fact that . is not an edge of . and that . satisfies . implies .. Duarte et al. [MFCS 2021] developed an algorithmic framework for co-degeneracy parameterization based on the notion of closures for solving problems that are作者: 聯(lián)邦 時(shí)間: 2025-3-22 11:19
,Extending Partial Representations of?Circular-Arc Graphs, non-distinct endpoints: In the former case the algorithm for normal Helly circular-arc representations can be extended, whereas the latter case turns out to be .-complete. We also prove that the partial representation extension problem for unit circular-arc graphs is .-complete.作者: 撫慰 時(shí)間: 2025-3-22 13:05
,Bounding Threshold Dimension: Realizing Graphic Boolean Functions as?the?AND of?Majority Gates, as the AND of only exponentially many majority gates motivates us to study threshold dimension of graphs. We give tight or nearly tight upper bounds for the threshold dimension of a graph in terms of its treewidth, maximum degree, degeneracy, number of vertices, size of a minimum vertex cover, etc.作者: 撫慰 時(shí)間: 2025-3-22 20:42 作者: OASIS 時(shí)間: 2025-3-22 21:54
Moderne italienische Strafrechtsdenkerlude not only a comparatively simple definition, but mainly that it has interesting algorithmic properties: it can be computed by a fixed-parameter algorithm, and it yields fixed-parameter algorithms for all the aforementioned problems where tree-cut width failed to do so.作者: transient-pain 時(shí)間: 2025-3-23 05:17 作者: entrance 時(shí)間: 2025-3-23 06:55 作者: Infect 時(shí)間: 2025-3-23 11:29 作者: helper-T-cells 時(shí)間: 2025-3-23 14:34 作者: 無表情 時(shí)間: 2025-3-23 20:02 作者: 下邊深陷 時(shí)間: 2025-3-23 23:37
https://doi.org/10.1007/978-3-642-52943-6]. In this article, we answer this question positively by designing an algorithm which uses a very recent result by Kim et al. [STOC 2022] about directed flow augmentation as subroutine..We also study a variant of this problem where there is no bound on the size of the solution, but the parameter is作者: Concomitant 時(shí)間: 2025-3-24 06:16
https://doi.org/10.1007/978-3-658-40381-2at Roman domination behaves differently in two aspects: enumeration and extension. We develop non-trivial enumeration algorithms for minimal Roman dominating functions with polynomial delay and polynomial space. Recall that the existence of a similar enumeration result for minimal dominating sets is作者: GULP 時(shí)間: 2025-3-24 10:35
https://doi.org/10.1007/978-3-642-60321-1Let . be a convex point set of . points and let . be a family of plane drawings on .. Two plane perfect matchings . and . on . (which do not need to be disjoint nor compatible) are . . if there exists a drawing in . which is disjoint compatible to both . and .. In this work, we consider the graph wh作者: 拋物線 時(shí)間: 2025-3-24 13:55
Moderne Zeiten in der Automobilfabrikat testing isomorphism of chordal graphs is polynomial-time equivalent to the general graph isomorphism problem. Every chordal graph can be represented as the intersection graph of some subtrees of a representing tree, and the leafage of a chordal graph is defined to be the minimum number of leaves 作者: 財(cái)政 時(shí)間: 2025-3-24 14:58 作者: CLOWN 時(shí)間: 2025-3-24 22:06
https://doi.org/10.1007/978-3-642-99692-4dependent sets such that for all . the set . is an independent set of size?., ., . and .. Intuitively, we view each independent set as a collection of tokens placed on the vertices of the graph. Then, the problem asks whether there exists a sequence of independent sets that transforms . into . where作者: troponins 時(shí)間: 2025-3-25 02:14
Literaturwissenschaft / Kulturwissenschaft graph is a leaf power if it is a .-leaf power for some .. Over 20 years ago, Nishimura et al. [J. Algorithms, 2002] asked if recognition of leaf powers was in P. Recently, Lafond [SODA 2022] showed an XP algorithm when parameterized by ., while leaving the main question open. In this paper, we expl作者: ARY 時(shí)間: 2025-3-25 05:23
Moderne deutsche Strafrechtsdenkerized by stable gonality, a novel graph parameter based on optimal maps from graphs to trees. The problems we consider are classical flow and orientation problems, such as ., ., and capacitated optimization problems such as .. Our hardness claims beat existing results. The FPT algorithms use a new pa作者: affluent 時(shí)間: 2025-3-25 08:44 作者: 評(píng)論性 時(shí)間: 2025-3-25 13:49
https://doi.org/10.1007/978-3-642-58246-2hbourhood of . is bijective, injective or surjective, respectively. The corresponding decision problems, ., . and ., are well studied both on general graphs and on special graph classes. We prove a number of new ., .[1]-hard and para-.-complete results by considering a hierarchy of parameters of the作者: 假 時(shí)間: 2025-3-25 17:36
https://doi.org/10.1007/978-3-531-93404-4each connected component of the resulting graph has a diameter at most .. When ., the corresponding problem is popularly known as .. We provide a faster algorithm for . . on .. For each ., we give an .-time algorithm for . . on interval graphs with . vertices and . edges. In the case of ., our algor作者: 驚奇 時(shí)間: 2025-3-25 22:11 作者: ungainly 時(shí)間: 2025-3-26 00:19
https://doi.org/10.1007/978-3-642-72664-4emoval yields an acyclic graph. More precisely, we aim to determine for which parameterizations this problem admits a polynomial kernel. While a characterization is known for the related . problem based on the recently introduced notion of bridge-depth, it remained an open problem whether this could作者: AROMA 時(shí)間: 2025-3-26 05:15 作者: Guaff豪情痛飲 時(shí)間: 2025-3-26 11:15 作者: 施舍 時(shí)間: 2025-3-26 14:45 作者: 陳列 時(shí)間: 2025-3-26 18:37
Moderne, Staat und Internationale Politikzed approximation scheme (EPAS) when the parameters are?., the number of outliers and the doubling dimension of the supplier set. On the other hand, we show that for the . . . problem, which is a special case of ., obtaining a parameterized approximation scheme (PAS) is?.-hard when the parameters ar作者: Inelasticity 時(shí)間: 2025-3-27 00:42 作者: 災(zāi)禍 時(shí)間: 2025-3-27 02:36
Moderner Bankvertrieb im Dienst des Kundenvectors of the cliques of .. Introduced in [Aggregation of inequalities in integer programming. Chvátal and Hammer, Annals of Discrete Mathematics, 1977], the . of a graph ., denoted by ., is the minimum number of threshold graphs whose intersection yields .. Given a graph . on . vertices, in line w作者: Coronation 時(shí)間: 2025-3-27 05:52 作者: 使顯得不重要 時(shí)間: 2025-3-27 11:50 作者: ICLE 時(shí)間: 2025-3-27 16:55 作者: happiness 時(shí)間: 2025-3-27 20:39 作者: 乞丐 時(shí)間: 2025-3-27 22:57
,Twin-Width and?Transductions of?Proper ,-Mixed-Thin Graphs,kes classes of efficiently bounded twin-width attractive from the algorithmic point of view. In particular, such classes (of small twin-width) include proper interval graphs, and (as digraphs) posets of width?.. Inspired by an existing generalization of interval graphs into so-called .-thin graphs, 作者: mechanism 時(shí)間: 2025-3-28 05:31
,Token Sliding on?Graphs of?Girth Five,dependent sets such that for all . the set . is an independent set of size?., ., . and .. Intuitively, we view each independent set as a collection of tokens placed on the vertices of the graph. Then, the problem asks whether there exists a sequence of independent sets that transforms . into . where作者: ARK 時(shí)間: 2025-3-28 09:18
,Recognition of?Linear and?Star Variants of?Leaf Powers is in?P, graph is a leaf power if it is a .-leaf power for some .. Over 20 years ago, Nishimura et al. [J. Algorithms, 2002] asked if recognition of leaf powers was in P. Recently, Lafond [SODA 2022] showed an XP algorithm when parameterized by ., while leaving the main question open. In this paper, we expl作者: 初學(xué)者 時(shí)間: 2025-3-28 14:03 作者: mortgage 時(shí)間: 2025-3-28 17:17
,Edge-Cut Width: An Algorithmically Driven Analogue of?Treewidth Based on?Edge Cuts,-hard parameterized by treewidth, a natural alternative would be to use a suitable analogue of treewidth that is based on edge cuts instead of vertex separators. While tree-cut width has been coined as such an analogue of treewidth for edge cuts, its algorithmic applications have often led to disapp作者: 磨坊 時(shí)間: 2025-3-28 22:48
,An Algorithmic Framework for?Locally Constrained Homomorphisms,hbourhood of . is bijective, injective or surjective, respectively. The corresponding decision problems, ., . and ., are well studied both on general graphs and on special graph classes. We prove a number of new ., .[1]-hard and para-.-complete results by considering a hierarchy of parameters of the作者: malign 時(shí)間: 2025-3-29 02:53
,s-Club Cluster Vertex Deletion on?Interval and?Well-Partitioned Chordal Graphs,each connected component of the resulting graph has a diameter at most .. When ., the corresponding problem is popularly known as .. We provide a faster algorithm for . . on .. For each ., we give an .-time algorithm for . . on interval graphs with . vertices and . edges. In the case of ., our algor作者: DRILL 時(shí)間: 2025-3-29 03:17
,Polychromatic Colorings of?Unions of?Geometric Hypergraphs,capturing hypergraph is an .-uniform hypergraph whose vertices are points in the plane and whose hyperedges are those .-subsets of points that can be separated by some geometric object of a particular type, such as axis-aligned rectangles, from the remaining points. Polychromatic .-colorings of .-un作者: ODIUM 時(shí)間: 2025-3-29 08:44 作者: 被告 時(shí)間: 2025-3-29 15:27 作者: 名詞 時(shí)間: 2025-3-29 17:19
,On the?Minimum Cycle Cover Problem on?Graphs with?Bounded Co-degeneracy,rameter . of ., especially for sparse graph parameters such as treewidth. In 2021, Duarte, Oliveira, and Souza [MFCS?2021] showed some problems that are FPT when parameterized by the treewidth of the complement graph (called co-treewidth). Since the degeneracy of a graph is at most its treewidth, th作者: 溫室 時(shí)間: 2025-3-29 20:40 作者: Horizon 時(shí)間: 2025-3-30 01:47
Generalized ,-Center: Distinguishing Doubling and Highway Dimension,zed approximation scheme (EPAS) when the parameters are?., the number of outliers and the doubling dimension of the supplier set. On the other hand, we show that for the . . . problem, which is a special case of ., obtaining a parameterized approximation scheme (PAS) is?.-hard when the parameters ar作者: 生命層 時(shí)間: 2025-3-30 07:31
,Extending Partial Representations of?Circular-Arc Graphs,We consider this problem for circular-arc graphs, where several arcs are predrawn and we ask whether this partial representation can be completed. We show that this problem is .-complete for circular-arc graphs, answering a question of Klavík et al.?(2014)..We complement this hardness with tractabil作者: kidney 時(shí)間: 2025-3-30 08:55
,Bounding Threshold Dimension: Realizing Graphic Boolean Functions as?the?AND of?Majority Gates,vectors of the cliques of .. Introduced in [Aggregation of inequalities in integer programming. Chvátal and Hammer, Annals of Discrete Mathematics, 1977], the . of a graph ., denoted by ., is the minimum number of threshold graphs whose intersection yields .. Given a graph . on . vertices, in line w作者: BLANK 時(shí)間: 2025-3-30 12:45 作者: isotope 時(shí)間: 2025-3-30 18:31 作者: 反話 時(shí)間: 2025-3-31 00:44 作者: ADORE 時(shí)間: 2025-3-31 01:53
,Token Sliding on?Graphs of?Girth Five, there exists a constant . such that the problem becomes fixed-parameter tractable on graphs of girth at least .. We answer their question positively and prove that the problem is indeed fixed-parameter tractable on graphs of girth five or more, which establishes a full classification of the tractability of . based on the girth of the input graph.作者: BANAL 時(shí)間: 2025-3-31 07:37 作者: FLIP 時(shí)間: 2025-3-31 12:25 作者: Hypopnea 時(shí)間: 2025-3-31 15:13
Literaturwissenschaft / Kulturwissenschaftrs was in P. Recently, Lafond [SODA 2022] showed an XP algorithm when parameterized by ., while leaving the main question open. In this paper, we explore this question from the perspective of two alternative models of leaf powers, showing that both a linear and a star variant of leaf powers can be recognized in polynomial-time.作者: 移動(dòng) 時(shí)間: 2025-3-31 21:24 作者: Fluctuate 時(shí)間: 2025-4-1 01:27 作者: 恩惠 時(shí)間: 2025-4-1 03:26 作者: Lethargic 時(shí)間: 2025-4-1 09:26 作者: MEET 時(shí)間: 2025-4-1 13:32
,Problems Hard for?Treewidth but?Easy for?Stable Gonality,on problems, such as ., ., and capacitated optimization problems such as .. Our hardness claims beat existing results. The FPT algorithms use a new parameter “treebreadth”, associated to a weighted tree partition, as well as DP and ILP.
