Blar i Department of Informatics på emneord "treewidth"
Viser treff 1-1 av 1
-
Maximum matching width: New characterizations and a fast algorithm for dominating set
(Peer reviewed; Journal article, 2015)We give alternative definitions for maximum matching width, e.g., a graph G has mmw(G) <= k if and only if it is a subgraph of a chordal graph H and for every maximal clique X of H there exists A,B,C \subseteq X with A ...