Sciweavers

CCCG
2007
14 years 18 days ago
On Bus Graph Realizability
In this paper, we consider the following graph embedding problem: Given a bipartite graph G = (V1, V2; E), where the maximum degree of vertices in V2 is 4, can G be embedded on a t...
Anil Ada, Melanie Coggan, Paul Di Marco, Alain Doy...