Publication:3759947
From MaRDI portal
zbMath0622.68056MaRDI QIDQ3759947
Thomas Lengauer, Klaus W. Wagner
Publication date: 1987
CAD; graph grammar; hierarchical graph model; hierarchical description; threshold network flow problem
68Q25: Analysis of algorithms and problem complexity
68Q45: Formal languages and automata
68R10: Graph theory (including graph drawing) in computer science
90B10: Deterministic network models in operations research
05C99: Graph theory
Related Items
On matroids and hierarchical graphs, Parallel algorithms for a class of graphs generated recursively, The binary network flow problem is logspace complete for P, On matroids and hierarchical graphs, The computational complexity of graph problems with succinct multigraph representation