496 search results - page 34 / 100 » C4-saturated bipartite graphs |
JCT
2010
13 years 6 months ago
2010
Abstract. A graph is connected-homogeneous if any isomorphism between finite connected induced subgraphs extends to an automorphism of the graph. In this paper we classify the cou...
APPROX
2008
Springer
13 years 9 months ago
2008
Springer
Let H be a graph, and let CH(G) be the number of (subgraph isomorphic) copies of H contained in a graph G. We investigate the fundamental problem of estimating CH(G). Previous res...
SIGECOM
2010
ACM
13 years 6 months ago
2010
ACM
We derive efficient algorithms for both detecting and representing matchings in lopsided bipartite graphs; such graphs have so many nodes on one side that it is infeasible to repr...
JMMA
2010
13 years 2 months ago
2010
This paper follows a word-document co-clustering model independently introduced in 2001 by several authors such as I.S. Dhillon, H. Zha and C. Ding. This model consists in creatin...
SWAT
2004
Springer
14 years 1 months ago
2004
Springer
In this paper, we consider the problems of generating all maximal (bipartite) cliques in a given (bipartite) graph G = (V, E) with n vertices and m edges. We propose two algorithms...