82 search results - page 1 / 17 » Efficient algorithms for finding critical subgraphs |
DAM
2008
13 years 4 months ago
2008
This paper presents algorithms to find vertex-critical and edgecritical subgraphs in a given graph G, and demonstrates how these critical subgraphs can be used to determine the ch...
ENDM
2000
13 years 4 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...
IPL
2010
13 years 2 months ago
2010
Polynomial algorithms are given for the following two problems:
ICDM
2009
IEEE
13 years 2 months ago
2009
IEEE
The recent proliferation of graph data in a wide spectrum of applications has led to an increasing demand for advanced data analysis techniques. In view of this, many graph mining ...
SDM
2004
SIAM
13 years 6 months ago
2004
SIAM
Graph-based modeling has emerged as a powerful abstraction capable of capturing in a single and unified framework many of the relational, spatial, topological, and other characteri...