Efficient Solution of Connectivity Problems on Hierarchically Defined Graphs

This publication has 8 references indexed in Scilit:

• The correlation between the complexities of the non-hierarchical and hierarchical versions of graph problems
  Published by Springer Nature ,2006
• Efficient algorithms for finding minimum spanning forests of hierarchically defined graphs
  Journal of Algorithms, 1987
• Hierarchical planarity testing algorithms
  Published by Springer Nature ,1986
• Succinct representations of graphs
  Information and Control, 1983
• The complexity of compacting hierarchically specified layouts of integrated circuits
  Published by Institute of Electrical and Electronics Engineers (IEEE) ,1982
• Context-free grammars as a tool for describing polynomial-time subclasses of hard problems
  Information Processing Letters, 1982
• Depth-First Search and Linear Graph Algorithms
  SIAM Journal on Computing, 1972
• GRAPH THEORY
  Published by Defense Technical Information Center (DTIC) ,1969