251 search results - page 21 / 51 » The Graphs with All Subgraphs T-Perfect |
ENDM
2000
13 years 7 months ago
2000
We propose a new exact algorithm for finding the chromatic number of a graph G. The algorithm attempts to determine the smallest possible induced subgraph G' of G which has t...
SSDBM
2010
IEEE
13 years 6 months ago
2010
IEEE
Currently, a large amount of data can be best represented as graphs, e.g., social networks, protein interaction networks, etc. The analysis of these networks is an urgent research ...
TCS
2008
13 years 7 months ago
2008
We exemplify an optimization criterion for divide-and-conquer algorithms with a technique called generic competitive graph search. The technique is then applied to solve two probl...
STOC
2005
ACM
14 years 8 months ago
2005
ACM
A graph property is called monotone if it is closed under taking (not necessarily induced) subgraphs (or, equivalently, if it is closed under removal of edges and vertices). Many ...
SIGMOD
2010
ACM
14 years 14 days ago
2010
ACM
Mining graph patterns in large networks is critical to a variety of applications such as malware detection and biological module discovery. However, frequent subgraphs are often i...