A Hybrid Graph Representation for Recursive Backtracking Algorithms

DOI10.1007/978-3-642-14553-7_15zbMath1288.68188OpenAlexW1492022068MaRDI QIDQ3587345

Amer E. Mouawad, Clinton P. Nolan, Faisal N. Abu-Khzam, Michael A. Langston

Publication date: 7 September 2010

Published in: Frontiers in Algorithmics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-14553-7_15

zbMATH Keywords

data structuresdominating setvertex coverexact algorithmsrecursive backtracking

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Graph algorithms (graph-theoretic aspects) (05C85) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Data structures (68P05)

Related Items (1)

Turbo-Charging Dominating Set with an FPT Subroutine: Further Improvements and Experimental Analysis

This page was built for publication: A Hybrid Graph Representation for Recursive Backtracking Algorithms