scientific article; zbMATH DE number 4009832

zbMATH Open0622.68056MaRDI QIDQ3759947FDOQ3759947

K. W. Wagner, Thomas Lengauer

Publication date: 1987

Title of this publication is not available (Why is that?)

Recommendations

• The correlation between the complexities of the nonhierarchical and hierarchical versions of graph problems
• scientific article; zbMATH DE number 751134
• A parametrized analysis of algorithms on hierarchical graphs
• A Parametrized Analysis of Algorithms on Hierarchical Graphs
• scientific article; zbMATH DE number 3960992

zbMATH Keywords

CADgraph grammarhierarchical graph modelhierarchical descriptionthreshold network flow problem

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10) Deterministic network models in operations research (90B10) Graph theory (05C99)

Cited In (8)

• The computational complexity of graph problems with succinct multigraph representation
• On matroids and hierarchical graphs
• Parallel algorithms for a class of graphs generated recursively
• On matroids and hierarchical graphs
• A Parametrized Analysis of Algorithms on Hierarchical Graphs
• The correlation between the complexities of the nonhierarchical and hierarchical versions of graph problems
• The binary network flow problem is logspace complete for P
• Efficient Solution of Connectivity Problems on Hierarchically Defined Graphs

This page was built for publication:

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