Competitive graph searches

DOI10.1016/J.TCS.2007.10.048MaRDI QIDQ2481952zbMATH OpenOpenAlexFDO

Authors Binh-Minh Bui-Xuan, Christophe Paul, M. A. Habib

Publication date 15 April 2008

Published in Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL https://hal-lirmm.ccsd.cnrs.fr/lirmm-00132103/file/BHP07.pdf

zbMATH Keywords

graph searchdivide-and-conquer algorithmcommon connected graph componentsandwich graph problem

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Nonnumerical algorithms (68W05)

Recommendations

• Combinatorial Pattern Matching
• Fast algorithms for identifying maximal common connected sets of interval graphs
• A faster parallel connectivity algorithm on cographs
• Graph Sandwich Problems
• Parallel Algorithm for Cograph Recognition with Applications

Cites work

• scientific article; zbMATH DE number 3887060 (Why is no real title available?)
• scientific article; zbMATH DE number 5542185 (Why is no real title available?)
• scientific article; zbMATH DE number 1263228 (Why is no real title available?)
• scientific article; zbMATH DE number 1775391 (Why is no real title available?)
• Algorithms and Computation
• Algorithms – ESA 2005
• An algorithmic view of gene teams
• Applications of a Planar Separator Theorem
• Fast algorithms for identifying maximal common connected sets of interval graphs
• Fast algorithms to enumerate all common intervals of two permutations
• Graph Sandwich Problems
• Maintenance of a minimum spanning forest in a dynamic plane graph
• Multidimensional Divide-and-Conquer Maximin Recurrences
• On a property of the class of n-colorable graphs
• Partitive hypergraphs
• Solution of a Divide-and-Conquer Maximin Recurrence
• The homogeneous set sandwich problem
• The pair completion algorithm for the homogeneous set sandwich problem

Cited in

(5)

• Assessing the computational complexity of multi-layer subgraph detection
• Complexity issues for the sandwich homogeneous set problem
• An iterative procedure for evaluating digraph competitions
• Unique perfect phylogeny is NP-hard
• Combinatorial Pattern Matching

This page was built for publication: Competitive graph searches

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