The algorithmic use of hypertree structure and maximum neighbourhood orderings
From MaRDI portal
Publication:6184359
DOI10.1007/3-540-59071-4_38zbMath1528.68277OpenAlexW2159670762MaRDI QIDQ6184359
Feodor F. Dragan, Andreas Brandstädt, Victor Chepoi
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
Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10) Graph algorithms (graph-theoretic aspects) (05C85)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Domination, independent domination, and duality in strongly chordal graphs
- A heuristic for the p-center problem in graphs
- Labeling algorithms for domination problems in sun-free chordal graphs
- Topics on domination
- The algorithmic use of hypertree structure and maximum neighbourhood orderings
- A characterisation of rigid circuit graphs
- Doubly lexical ordering of dense 0--1 matrices
- Covering, Packing and Generalized Perfection
- Simple Linear-Time Algorithms to Test Chordality of Graphs, Test Acyclicity of Hypergraphs, and Selectively Reduce Acyclic Hypergraphs
- State of the Art—Location on Networks: A Survey. Part II: Exploiting Tree Network Structure
- The k-Domination and k-Stability Problems on Sun-Free Chordal Graphs
- Steiner trees, connected domination and strongly chordal graphs
- Doubly Lexical Orderings of Matrices
- Solving NP-Hard Problems on Graphs That Are Almost Trees and an Application to Facility Location Problems
- Three Partition Refinement Algorithms
- An Algorithmic Approach to Network Location Problems. I: Thep-Centers
- An $O(n\log ^2 n)$ Algorithm for the kth Longest Path in a Tree with Applications to Location Problems
- Location on Tree Networks: P-Centre and n-Dispersion Problems
- R -Domination in Graphs
- Dually Chordal Graphs
- Clique Graphs of Chordal and Path Graphs
- Doubly chordal graphs, steiner trees, and connected domination
