Searching for authors named "Thomas Andreae" – sorted by Relevance.

Order by: Citations | Year (Descending) | Year (Ascending) | Recency

Try your query at: Scholar | Yahoo! | Ask | Bing | CSB

5 documents found, showing 1 through 5.

Cartesian products of graphs as spanning subgraphs of de Bruijn graphs (Extended Abstract)
by Thomas Andreae, Michael Nölle, Gerald Schreiber, Mathematisches Seminar — 1994
…Thomas Andreae , Michael Nolle , Gerald Schreiber Mathematisches Seminar Universitat Hamburg Bundesstrae 55 Technische Universitat Hamburg-Harburg Technische Informatik I Harburger Schlostrae 20 To appear in: Proceedings of the 20. Workshop "Graph-Theoretic Concepts in Computer Sci…
Cited by 7 (5 self) – Add To MetaCart

On embedding 2-dimensional toroidal grids into de Bruijn graphs with clocked congestion one
by Thomas Andreae, Michael Nölle, Christof Rempel, Gerald Schreiber, Mathematisches Seminar — 1995
…For integers m; d; D with m 3; d 2; and D 2, let T (m) be a 2--dimensional quadratic toroidal grid with side length m and let B(d;D) be the base d, dimension D de Bruijn graph; assume that jT (m)j = jB(d; D)j. The starting point for our investigations is the observation that, for m;D even, em…
Cited by 2 (0 self) – Add To MetaCart

Embedding Cartesian Products of Graphs into de Bruijn Graphs
by Thomas Andreae, Michael Nölle, G. Schreiber, Technische Informatik I, Technische Informatik I, Thomas Andreae, Michael Nolle, Gerald Schreiber — 1995 — Internal Report 3/95, Technische Informatik I, TU-HH
…For Cartesian products G = G 1 \Theta : : :\Theta Gm (m 2) of nontrivial connected graphs G i and the n- dimensional base B de Bruijn graph D = DB (n), we investigate whether or not there exists a spanning subgraph of D which is isomorphic to G. We show that G is never a spanning subgraph of D when…
Cited by 4 (1 self) – Add To MetaCart

Cartesian products of graphs as subgraphs of de Bruijn graphs of dimension at least three
by Thomas Andreae, Martin Hintz, Martin Nölle, Gerald W. Schuster, Gerald Schreiber, Gerald W, Hajo Seng — 1995 — in 4th Twente Workshop on graphs and combinatorial optimization
…Given a Cartesian product G = G 1 \Theta : : : \Theta Gm (m 2) of nontrivial connected graphs G i and the base d, dimension D de Bruijn graph B(d; D), it is investigated under which conditions G is (or is not) a subgraph of B(d; D). We present a complete solution of this problem for the case D …
Cited by 2 (1 self) – Add To MetaCart

Embedding Cartesian Products of Graphs
by Into De Bruijn, Thomas Andreae, Michael Nolle, Gerald Schreiber, Technische Informatik I, Harburger Schlostrae — 1997 — Internal Report 3/95, Technische Informatik I, TU-HH
…Given a Cartesian product G = G 1 \Theta : : : \Theta Gm (m 2) of nontrivial connected graphs G i and the n--dimensional base B de Bruijn graph D = DB (n), it is investigated whether or not G is a spanning subgraph of D. Special attention is given to graphs G = G 1 \Theta : : : \Theta Gm which a…
Add To MetaCart

Showing 1 through 5.

Try your query at: Scholar | Yahoo! | Ask | Bing | CSB