scientific article; zbMATH DE number 6850484

zbMATH Open1403.68157MaRDI QIDQ4608071FDOQ4608071

Authors David Coudert, Guillaume Ducoffe, Alexandru Popa 

Publication date 15 March 2018

Full work available at URL http://dl.acm.org/citation.cfm?id=3175480

Mathematics Subject Classification ID

Graph algorithms (graph-theoretic aspects) (05C85) Graph theory (including graph drawing) in computer science (68R10) Analysis of algorithms (68W40) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)

Recommendations

• Fully polynomial FPT algorithms for some classes of bounded clique-width graphs
• Polynomial algorithms for partitioning problems on graphs with fixed clique-width (extended abstract)
• Computing Graph Polynomials on Graphs of Bounded Clique-Width
• scientific article; zbMATH DE number 2044928
• Tight complexity bounds for FPT subgraph problems parameterized by the clique-width
• Tight complexity bounds for FPT subgraph problems parameterized by clique-width
• Computing the Tutte Polynomial on Graphs of Bounded Clique‐Width
• Graph-Theoretic Concepts in Computer Science
• Better polynomial algorithms on graphs of bounded rank-width
• A unified approach to polynomial algorithms on graphs of bounded (bi-)rank-width

Cited in

(20)

• An Adaptive Version of Brandes' Algorithm for Betweenness Centrality
• The \(b\)-\textsc{Matching} problem in distance-hereditary graphs and beyond
• Computing Graph Polynomials on Graphs of Bounded Clique-Width
• Data Reduction for Maximum Matching on Real-World Graphs: Theory and Experiments
• On adaptive algorithms for maximum matching
• Fast approximation and exact computation of negative curvature parameters of graphs
• On the power of tree-depth for fully polynomial FPT algorithms
• Iterated Type Partitions
• A linear-time algorithm for maximum-cardinality matching on cocomparability graphs
• Efficient and Adaptive Parameterized Algorithms on Modular Decompositions
• scientific article; zbMATH DE number 2044928 (Why is no real title available?)
• Maximum matching in almost linear time on graphs of bounded clique-width
• Fully polynomial FPT algorithms for some classes of bounded clique-width graphs
• Fast approximation and exact computation of negative curvature parameters of graphs
• When can graph hyperbolicity be computed in linear time?
• Diameter, eccentricities and distance oracle computations on \(H\)-minor free graphs and graphs of bounded (distance) Vapnik-Chervonenkis dimension
• Low-congestion shortcut and graph parameters
• Maximum Matching in almost linear time on graphs of bounded clique-width
• scientific article; zbMATH DE number 7561360 (Why is no real title available?)
• scientific article; zbMATH DE number 7561384 (Why is no real title available?)

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4608071)