641 search results - page 54 / 129 » On Planar Quasi-Parity Graphs |
182
click to vote
ENDM
2008
15 years 6 months ago
2008
In this paper we study some connectivity augmentation problems. Given a connected graph G with some desirable property, we want to make G 2-vertex connected (or 2-edge connected) ...
188
click to vote
SENSYS
2006
ACM
16 years 2 days ago
2006
ACM
Geographic techniques promise highly scalable any-toany routing in wireless sensor networks. In one thread of research on geographic routing, researchers have explored robust, dis...
136
click to vote
COCOON
2001
Springer
15 years 10 months ago
2001
Springer
A data structure called PC-tree is introduced as a generalization of PQ-trees. PC-trees were originally introduced in a planarity test of Shih and Hsu [7] where they represent par...
185
click to vote
IPL
2008
15 years 6 months ago
2008
We use transfer matrix methods to determine bounds for the numbers of legal Go positions for various numbers of players on some planar lattice graphs, including square lattice gra...
201
click to vote
ISAAC
2010
Springer
15 years 4 months ago
2010
Springer
A permutation graph is an intersection graph of segments lying between two parallel lines. A Seidel complementation of a finite graph at a vertex v consists in complementing the ed...