19 search results - page 1 / 4 » Large Topological Cliques in Graphs Without a 4-Cycle |
CPC
2004
13 years 6 months ago
2004
Mader asked whether every C4-free graph G contains a subdivision of a complete graph whose order is at least linear in the average degree of G. We show that there is a subdivision...
ICDE
2006
IEEE
14 years 8 months ago
2006
IEEE
Most previously proposed frequent graph mining algorithms are intended to find the complete set of all frequent, closed subgraphs. However, in many cases only a subset of the freq...
COMBINATORICA
2010
13 years 4 months ago
2010
In this paper, we propose a simple and natural randomized algorithm to embed a tree T in a given graph G. The algorithm can be viewed as a "self-avoiding tree-indexed random ...
SIGMOD
2010
ACM
13 years 11 months ago
2010
ACM
Maximal clique enumeration (MCE) is a fundamental problem in graph theory and has important applications in many areas such as social network analysis and bioinformatics. The prob...
SENSYS
2003
ACM
14 years 3 days ago
2003
ACM
The widespread deployment of sensor networks is on the horizon. One of the main challenges in sensor networks is to process and aggregate data in the network rather than wasting e...