251 search results - page 34 / 51 » The Graphs with All Subgraphs T-Perfect |
SODA
2000
ACM
15 years 1 months ago
2000
ACM
The Steiner tree problem in weighted graphs seeks a minimum weight connected subgraph containing a given subset of the vertices terminals. We present a new polynomial-time heurist...
112
click to vote
IM
2008
14 years 11 months ago
2008
Let G = G(n, r) be a random geometric graph resulting from placing n nodes uniformly at random in the unit square (disk) and connecting every two nodes if and only if their Euclide...
RTCSA
2007
IEEE
15 years 6 months ago
2007
IEEE
MB++ is a system that caters to the dynamic needs of applications in a distributed, pervasive computing environment that has a wide variety of devices that act as producers and co...
PKDD
2010
Springer
14 years 10 months ago
2010
Springer
We present a tool for interactive exploration of graphs that integrates advanced graph mining methods in an interactive visualization framework. The tool enables efficient explorat...
WEA
2009
Springer
15 years 6 months ago
2009
Springer
We propose new practical algorithms to find degree-relaxed variants of cliques called s-plexes. An s-plex denotes a vertex subset in a graph inducing a subgraph where every vertex...