Combinatorial Graph Embedding.
Abstract
Let G, G' be directed graphs. A combinatorial embedding of G into G' is an identification of each x an element of V(G) with a set of vertices S a subset of V(G') such that each S is bounded in size by a constant independent of <V(G)> and each arc in G is carried into a directed path of length bounded by a constant independent of <V(G)>. This concept has formed the basis for a number of theoretical studies and the papers collected here are representative of - with one major exception - the state-of-the-art with regard to graph embedding.
Document Details
- Document Type
- Technical Report
- Publication Date
- Jan 01, 1980
- Accession Number
- ADA081247
Entities
People
- R. A. Demillo
- R. Lipton
- S. C. Eisenstat
Organizations
- Georgia Tech