What people are saying - Write a review
We haven't found any reviews in the usual places.
Efficient Computations in TreeLike Graphs
Graph Problems Related to Gate Matrix Layout and
Planar Graph Problems
10 other sections not shown
Other editions - View all
adjacent algebraic antimatroids assigned bipartite graph block folding bound chordal graphs class of graphs clique color classes column combinatorial comparability graphs complexity Computer Science connected constructed corresponding cycle decomposition defined denote dilation edge congestion efficient parallel element embedding endpoints equation example Figure finite gate matrix layout given graph coloring graph G Graph Theory Graphen heap hypercube IEEE implication class independent set interval graph iteration labelled Lemma Math maximal maximum matching mesh minimal minimum Nishizeki nodes NP-complete NP-hard obtained operation optimal ordered sets pair parallel algorithms partial fc-trees partial order partition perfect graphs permutation PLA folding planar graphs polynomial procedure processor programming proof R. E. Tarjan random graphs recursive root rows schedule searchers semiring sequential shortest path problem SIAM solution solved step subgraph subset tasks techniques theorem transitive orientation undirected graph unlabelled graphs vertex set vertices VLSI