20 search results - page 1 / 4 » Highly connected multicoloured subgraphs of multicoloured gr... |
DM
2008
13 years 4 months ago
2008
We consider the following question of Bollob
EDBT
2012
ACM
11 years 7 months ago
2012
ACM
In this paper, we study how to find maximal k-edge-connected subgraphs from a large graph. k-edge-connected subgraphs can be used to capture closely related vertices, and findin...
JGT
2007
13 years 4 months ago
2007
A well-known theorem of Mader [5] states that highly connected subgraphs can be forced in finite graphs by assuming a high minimum degree. Solving a problem of Diestel [2], we ex...
SPAA
2005
ACM
13 years 10 months ago
2005
ACM
We prove that with high probability a skip graph contains a 4-regular expander as a subgraph, and estimate the quality of the expansion via simulations. As a consequence skip grap...
SIGMOD
2010
ACM
13 years 9 months 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...