The algorithmic use of hypertree structure and maximum neighbourhood orderings

DOI10.1007/3-540-59071-4_38MaRDI QIDQ6184359zbMATH OpenOpenAlexFDO

Authors Andreas Brandstädt, Victor Chepoi, Feodor F. Dragan

Publication date 5 January 2024

Published in Graph-Theoretic Concepts in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/3-540-59071-4_38

Mathematics Subject Classification ID

Graph algorithms (graph-theoretic aspects) (05C85) Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10)

Recommendations

• The algorithmic use of hypertree structure and maximum neighbourhood orderings
• Tree-structured graphs
• scientific article; zbMATH DE number 1234609
• Homogeneously orderable graphs
• scientific article; zbMATH DE number 1302027

Cites work

• R -Domination in Graphs
• A characterisation of rigid circuit graphs
• A heuristic for the p-center problem in graphs
• An $O(n\log ^2 n)$ Algorithm for the kth Longest Path in a Tree with Applications to Location Problems
• An Algorithmic Approach to Network Location Problems. I: Thep-Centers
• Clique Graphs of Chordal and Path Graphs
• Covering, Packing and Generalized Perfection
• Domination, independent domination, and duality in strongly chordal graphs
• Doubly chordal graphs, steiner trees, and connected domination
• Doubly lexical ordering of dense 0--1 matrices
• Doubly Lexical Orderings of Matrices
• Dually Chordal Graphs
• scientific article; zbMATH DE number 3843458 (Why is no real title available?)
• scientific article; zbMATH DE number 43754 (Why is no real title available?)
• scientific article; zbMATH DE number 177557 (Why is no real title available?)
• scientific article; zbMATH DE number 468643 (Why is no real title available?)
• scientific article; zbMATH DE number 706830 (Why is no real title available?)
• scientific article; zbMATH DE number 1414320 (Why is no real title available?)
• Labeling algorithms for domination problems in sun-free chordal graphs
• Location on Tree Networks: P-Centre and n-Dispersion Problems
• Simple Linear-Time Algorithms to Test Chordality of Graphs, Test Acyclicity of Hypergraphs, and Selectively Reduce Acyclic Hypergraphs
• Solving NP-Hard Problems on Graphs That Are Almost Trees and an Application to Facility Location Problems
• State of the Art—Location on Networks: A Survey. Part II: Exploiting Tree Network Structure
• Steiner trees, connected domination and strongly chordal graphs
• The k-Domination and k-Stability Problems on Sun-Free Chordal Graphs
• The algorithmic use of hypertree structure and maximum neighbourhood orderings
• Three Partition Refinement Algorithms
• Topics on domination

This page was built for publication: The algorithmic use of hypertree structure and maximum neighbourhood orderings

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