A hybrid graph representation for recursive backtracking algorithms

DOI10.1007/978-3-642-14553-7_15zbMATH Open1288.68188OpenAlexW1492022068MaRDI QIDQ3587345FDOQ3587345

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

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

Recommendations

• Automated generation of search tree algorithms for graph modification problems
• Representation of graphs and its algorithms based on BDD
• Accelerating backtrack search with a best-first-search strategy
• A theoretical analysis of backtracking in the graph coloring problem
• A theoretical evaluation of selected backtracking algorithms.

zbMATH Keywords

data structuresdominating setexact algorithmsvertex coverrecursive backtracking

Mathematics Subject Classification ID

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

Cited In (3)

• Turbo-charging dominating set with an FPT subroutine: further improvements and experimental analysis
• SAT solving using XOR-OR-AND normal forms.
• Title not available (Why is that?)

This page was built for publication: A hybrid graph representation for recursive backtracking algorithms

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