643 search results - page 47 / 129 » Supereulerian planar graphs |
178
click to vote
GD
2008
Springer
15 years 7 months ago
2008
Springer
Abstract. We present a linear-time algorithm for solving the simultaneous embedding problem with fixed edges (SEFE) for a planar graph and a pseudoforest (a graph with at most one...
155
click to vote
ALGORITHMICA
2004
15 years 6 months ago
2004
Eppstein [5] characterized the minor-closed graph families for which the treewidth is bounded by a function of the diameter, which includes e.g. planar graphs. This characterizatio...
189
click to vote
GC
2007
Springer
15 years 6 months ago
2007
Springer
A clique is a set of pairwise adjacent vertices in a graph. We determine the maximum number of cliques in a graph for the following graph classes: (1) graphs with n vertices and m ...
191
Voted
ICCSA
2007
Springer
16 years 27 days ago
2007
Springer
Abstract. Determining whether two segments s and t in a planar polygonal scene weakly see each other is a classical problem in computational geometry. In this problem we seek for a...
139
click to vote
ICRA
2006
IEEE
16 years 23 days ago
2006
IEEE
- This paper introduces a new approach to identify singularities of planar parallel manipulators (PPMs). This method is based on Maxwell’s reciprocal figure theory which establis...