2877 search results - page 6 / 576 » The Complexity of Planarity Testing |
PDPTA
2000
13 years 8 months ago
2000
GD
2008
Springer
13 years 8 months ago
2008
Springer
FAW
2007
Springer
14 years 1 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...
DAM
2008
13 years 7 months ago
2008
Given a graph G = (V, E) and a positive integer k, the PARTITION INTO CLIQUES (PIC) decision problem consists of deciding whether there exists a partition of V into k disjoint sub...
GD
2005
Springer
14 years 13 days ago
2005
Springer
A clustered graph has its vertices grouped into clusters in a hierarchical way via subset inclusion, thereby imposing a tree structure on the clustering relationship. The c-planari...