Buscar
Mostrando ítems 1-4 de 4
Artículo
Embedding a graph in the grid of a surface with the minimum number of bends is NP-hard
(1997)
This paper is devoted to the study of graph embeddings in the grid of non-planar surfaces. We provide an adequate model for those embeddings and we study the complexity of minimizing the number of bends. In particular, we ...
Artículo
A linear algorithm to recognize maximal generalized outerplanar graphs
(Institute of Mathematics of the Czech Academy of Sciences, 1997)
In this work, we get a combinatorial characterization for maximal generalized outerplanar graphs (mgo graphs). This result yields a recursive algorithm testing whether a graph is a mgo graph or not.
Artículo
A link between menger’s theorem and infinite euler graphs
(Akadémiai Kiadó, 1997)
Artículo
Assessing the Efficiency of Rapid Transit Configurations
(Sociedad de Estadistica e lnvestigaci6n Operativa, 1997)
Eight basic transit network configurations are analyzed with respect to two measures: passenger/network ef[ectiveness and passenger/plane effectiveness. Assumptions are made with respect to trip distribution and competition ...