Sciweavers

491 search results - page 77 / 99
» On cyclically orientable graphs
Sort
View
COMPGEOM
2010
ACM
14 years 13 days ago
Finding shortest non-trivial cycles in directed graphs on surfaces
Let D be a weighted directed graph cellularly embedded in a surface of genus g, orientable or not, possibly with boundary. We describe algorithms to compute a shortest non-contrac...
Sergio Cabello, Éric Colin de Verdiè...
APCCM
2009
13 years 8 months ago
Extracting Conceptual Graphs from Japanese Documents for Software Requirements Modeling
A requirements analysis step plays a significant role on the development of information systems, and in this step we various kinds of abstract models of the systems (called requir...
Ryo Hasegawa, Motohiro Kitamura, Haruhiko Kaiya, M...
EM
2010
155views Management» more  EM 2010»
13 years 7 months ago
Hyperbolic Graphs of Small Complexity
In this paper we enumerate and classify the "simplest" pairs (M, G) where M is a closed orientable 3-manifold and G is a trivalent graph embedded in M. To enumerate the p...
Damian Heard, Craig Hodgson, Bruno Martelli, Carlo...
SIES
2007
IEEE
14 years 1 months ago
Novel Genome Coding of Genetic Algorithms for the System Partitioning Problem
— The research field of partitioning for electronic systems started to attract significant attention of scientists about fifteen years ago. Gaining ever more importance due to...
Bastian Knerr, Martin Holzer 0002, Markus Rupp
CORR
2010
Springer
94views Education» more  CORR 2010»
13 years 7 months ago
Complexity dichotomy on partial grid recognition
Deciding whether a graph can be embedded in a grid using only unitlength edges is NP-complete, even when restricted to binary trees. However, it is not difficult to devise a numbe...
Vinícius G. P. de Sá, Guilherme Dias...