Efficient Solution of Connectivity Problems on Hierarchically Defined Graphs
From MaRDI portal
Recommendations
- The correlation between the complexities of the nonhierarchical and hierarchical versions of graph problems
- Succinct representations of graphs
- scientific article; zbMATH DE number 4009832
- scientific article; zbMATH DE number 3980506
- Efficient algorithms for finding minimum spanning forests of hierarchically defined graphs
Cited in
(22)- Efficient solutions of hierarchical systems of linear equations
- The complexity of combinatorial problems with succinct input representation
- Algorithms for graph problems on BNLC structured garphs
- On matroids and hierarchical graphs
- The correlation between the complexities of the nonhierarchical and hierarchical versions of graph problems
- Complexity of path-forming games
- Hierarchically specified unit disk graphs
- The complexity of connectivity problems on context-free graph languages
- Finite graph automata for linear and boundary graph languages
- Fixpoint logics over hierarchical structures
- Efficient Low-Level Connection Tableaux
- Solving Connected Subgraph Problems in Wildlife Conservation
- Model-checking hierarchical structures
- The complexity of approximating \(\mathrm{PSPACE}\)-complete problems for hierarchical specifications
- On matroids and hierarchical graphs
- A Parametrized Analysis of Algorithms on Hierarchical Graphs
- Parameterized algorithms for finding highly connected solution
- Parameterized algorithms for finding highly connected solution
- Hierarchically specified unit disk graphs
- Bounded tree-width and LOGCFL
- FO-query enumeration over SLP-compressed structures of bounded degree
- The virtual feedback problem in hierarchical representations of combinational circuits
This page was built for publication: Efficient Solution of Connectivity Problems on Hierarchically Defined Graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3826621)
