641 search results - page 15 / 129 » On Planar Quasi-Parity Graphs |
INFOCOM
2008
IEEE
15 years 4 months ago
2008
IEEE
Abstract—Wireless sensor networks need very efficient network protocols due to the sensors’ limited communication and computation capabilities. Network planarization – find...
COCO
2009
Springer
15 years 4 months ago
2009
Springer
Graph Isomorphism is the prime example of a computational problem with a wide difference between the best known lower and upper bounds on its complexity. There is a significant ...
DM
2010
14 years 10 months ago
2010
We prove that every planar graph in which no i-cycle is adjacent to a j-cycle whenever 3 i j 7 is 3-colorable and pose some related problems on the 3-colorability of planar grap...
GD
2009
Springer
15 years 2 months ago
2009
Springer
The geometric simultaneous embedding problem asks whether two planar graphs on the same set of vertices in the plane can be drawn using straight lines, such that each graph is pla...
108
click to vote
FAW
2007
Springer
15 years 4 months ago
2007
Springer
Abstract. Given a graph G and a nonnegative integer k, the NP-complete Induced Matching problem asks for an edge subset M such that M is a matching and no two edges of M are joined...