641 search results - page 47 / 129 » On Planar Quasi-Parity Graphs |
146
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...
174
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 ...
173
click to vote
ICCSA
2007
Springer
16 years 8 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...
126
click to vote
ICRA
2006
IEEE
16 years 4 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...
152
click to vote
ESA
2010
Springer
15 years 7 months ago
2010
Springer
Minor containment is a fundamental problem in Algorithmic Graph Theory, as numerous graph algorithms use it as a subroutine. A model of a graph H in a graph G is a set of disjoint ...