„clique-width“
Suchergebnisse
67 Treffer
-
XNLP-Completeness for Parameterized Problems on Graphs with a Linear Structure
-
Locally Checkable Problems Parameterized by Clique-Width
-
MSO Undecidability for Hereditary Classes of Unbounded Clique Width
-
A Unifying Framework for Characterizing and Computing Width Measures
-
Optimal Centrality Computations Within Bounded Clique-Width Graphs
-
Maximum Matching in Almost Linear Time on Graphs of Bounded Clique-Width
-
b-Coloring Parameterized by Clique-Width
-
Bounding the Mim-Width of Hereditary Graph Classes
-
Grundy Distinguishes Treewidth from Pathwidth
-
U-Bubble Model for Mixed Unit Interval Graphs and Its Applications: The MaxCut Problem Revisited
-
Structural Parameterizations of Clique Coloring
-
Counting Homomorphisms in Plain Exponential Time
-
Efficient Parameterized Algorithms for Computing All-Pairs Shortest Paths
-
Tracking Paths in Planar Graphs
-
Computing the Largest Bond of a Graph
-
Low-Congestion Shortcut and Graph Parameters
-
More Applications of the d-Neighbor Equivalence: Connectivity and Acyclicity Constraints
-
Finer Tight Bounds for Coloring on Clique-Width
-
Colouring Square-Free Graphs without Long Induced Paths
-
Structural Parameters, Tight Bounds, and Approximation for (k,r)-Center