796 search results - page 76 / 160 » The Anonymous Subgraph Problem |
131
click to vote
ALGORITHMICA
2008
15 years 27 days ago
2008
The profile of a graph is an integer-valued parameter defined via vertex orderings; it is known that the profile of a graph equals the smallest number of edges of an interval supe...
126
Voted
COLOGNETWENTE
2010
14 years 9 months ago
2010
Given a bipartite graph G = (S, T, E), we consider the problem of finding k bipartite subgraphs, called "clusters", such that each vertex i of S appears in exactly one o...
110
Voted
FSTTCS
2009
Springer
15 years 7 months ago
2009
Springer
In this paper, we initiate the study of designing approximation algorithms for FaultTolerant Group-Steiner (FTGS) problems. The motivation is to protect the well-studied group-Ste...
120
Voted
ICALP
2010
Springer
15 years 5 months ago
2010
Springer
Some of the currently best-known approximation algorithms for network design are based on random sampling. One of the key steps of such algorithms is connecting a set of source nod...
105
click to vote
APIN
2006
15 years 25 days ago
2006
The core issue of analogical reasoning is the transfer of relational knowledge from a source case to a target problem. Visual analogical reasoning pertains to problems containing ...