796 search results - page 8 / 160 » The Anonymous Subgraph Problem |
127
click to vote
AICCSA
2007
IEEE
15 years 8 months ago
2007
IEEE
In the maximum common subgraph (MCS) problem, we are given a pair of graphs and asked to find the largest induced subgraph common to them both. With its plethora of applications,...
111
click to vote
IPCO
2004
15 years 3 months ago
2004
We consider the problems of enumerating all minimal strongly connected subgraphs and all minimal dicuts of a given directed graph G = (V, E). We show that the first of these proble...
PKDD
2007
Springer
15 years 8 months ago
2007
Springer
100
Voted
FCT
2005
Springer
15 years 7 months ago
2005
Springer
ISAAC
2005
Springer
15 years 7 months ago
2005
Springer
