BetweenO(nm) andO(nalpha)

DOI10.1137/S0097539704441435zbMath1115.05086MaRDI QIDQ3434988

Dieter Kratsch, Jeremy P. Spinrad

Publication date: 3 May 2007

Published in: SIAM Journal on Computing (Search for Journal in Brave)

zbMATH Keywords

algorithmsgraphsreductionsAT-free graphsmatrix multiplicationstar cutsetdominating pairtwo-pair

Mathematics Subject Classification ID

Graph algorithms (graph-theoretic aspects) (05C85)

Related Items (8)

BOUNDED SEARCH TREE ALGORITHMS FOR PARAMETRIZED COGRAPH DELETION: EFFICIENT BRANCHING RULES BY EXPLOITING STRUCTURES OF SPECIAL GRAPH CLASSES ⋮ The diameter of AT‐free graphs ⋮ Organizing the atoms of the clique separator decomposition into an atom tree ⋮ Computing and listing avoidable vertices and paths ⋮ Computing and listing avoidable vertices and paths ⋮ Revisiting Decomposition by Clique Separators ⋮ On the Power of Graph Searching for Cocomparability Graphs ⋮ Fully Polynomial FPT Algorithms for Some Classes of Bounded Clique-width Graphs

This page was built for publication: BetweenO(nm) andO(n^alpha)