36 search results - page 1 / 8 » Algorithms for Enumerating All Perfect, Maximum and Maximal ... |
ISAAC
1997
Springer
13 years 9 months ago
1997
Springer
SWAT
2004
Springer
13 years 10 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...
COCO
2010
Springer
13 years 2 months ago
2010
Springer
An even cycle in a graph is called nice by Lov
PKDD
2005
Springer
13 years 10 months ago
2005
Springer
For an undirected graph ¢ without self-loop, we prove: (i) that the number of closed patterns in the adjacency matrix of ¢ is even; (ii) that the number of the closed patterns i...
ISAAC
2005
Springer
13 years 10 months ago
2005
Springer
In this paper, we deal with both the complexity and the approximability of the labeled perfect matching problem in bipartite graphs. Given a simple graph G = (V, E) with n vertices...