463 search results - page 7 / 93 » The Most Reliable Subgraph Problem |
109
Voted
ALGORITHMICA
2006
15 years 1 months ago
2006
The k-Leaf Power recognition problem is a particular case of graph power problems: For a given graph it asks whether there exists an unrooted tree--the k-leaf root--with leaves on...
180
click to vote
SIGMOD
2008
ACM
16 years 1 months ago
2008
ACM
Extracting dense sub-components from graphs efficiently is an important objective in a wide range of application domains ranging from social network analysis to biological network...
133
click to vote
BMCBI
2010
15 years 1 months ago
2010
Background: Finding the subgraphs of a graph database that are isomorphic to a given query graph has practical applications in several fields, from cheminformatics to image unders...
112
click to vote
IPCO
1993
15 years 3 months ago
1993
The survivable network design problem (SNDP) is to construct a minimum-cost subgraph satisfying certain given edge-connectivity requirements. The first polynomial-time approximati...
262
click to vote
AAIM
2011
Springer
14 years 5 months ago
2011
Springer
A star forest is a collection of vertex-disjoint trees of depth at most 1, and its size is the number of leaves in all its components. A spanning star forest of a given graph G is ...