796 search results - page 83 / 160 » The Anonymous Subgraph Problem |
SIGMOD
2010
ACM
15 years 5 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...
127
Voted
FOCS
2008
IEEE
15 years 7 months ago
2008
IEEE
Given a complete undirected graph, a cost function on edges and a degree bound B, the degree bounded network design problem is to find a minimum cost simple subgraph with maximum...
168
click to vote
ICALP
1995
Springer
15 years 4 months ago
1995
Springer
The problem to determine whether a given k-colored graph is a subgraph of a properly colored interval graph has an application in DNA physical mapping. In this paper, we study the...
102
Voted
CPAIOR
2007
Springer
15 years 7 months ago
2007
Springer
We study the complexity of combinatorial problems that consist of competing infeasibility and optimization components. In particular, we investigate the complexity of the connectio...
106
click to vote
ISAAC
2009
Springer
15 years 5 months ago
2009
Springer
For a connected graph G = (V, E), a subset U ⊆ V is called a k-cut if U disconnects G, and the subgraph induced by U contains exactly k (≥ 1) components. More specifically, a ...