Sciweavers

1963 search results - page 11 / 393
» The Maximum Solution Problem on Graphs
Sort
View
88
Voted
ICALP
2007
Springer
15 years 4 months ago
Parameterized Algorithms for Directed Maximum Leaf Problems
d Abstract) Noga Alon∗ Fedor V. Fomin† Gregory Gutin‡ Michael Krivelevich§ Saket Saurabh¶ We prove that finding a rooted subtree with at least k leaves in a directed grap...
Noga Alon, Fedor V. Fomin, Gregory Gutin, Michael ...
HPCC
2007
Springer
15 years 4 months ago
Maximum-Objective-Trust Clustering Solution and Analysis in Mobile Ad Hoc Networks
In mobile-AdHoc networks (MANETs), many applications need the support of layer-structure. Clustering solution is the most widely used layerstructure and the choosing of clusterhead...
Qiang Zhang, Guangming Hu, Zhenghu Gong
ORL
2008
115views more  ORL 2008»
14 years 10 months ago
Maximum algebraic connectivity augmentation is NP-hard
The algebraic connectivity of a graph, which is the second-smallest eigenvalue of the Laplacian of the graph, is a measure of connectivity. We show that the problem of adding a sp...
Damon Mosk-Aoyama
AAAI
2004
14 years 11 months ago
A General Solution to the Graph History Interaction Problem
Since the state space of most games is a directed graph, many game-playing systems detect repeated positions with a transposition table. This approach can reduce search effort by ...
Akihiro Kishimoto, Martin Müller 0003
130
Voted
WG
2004
Springer
15 years 3 months ago
A Robust PTAS for Maximum Weight Independent Sets in Unit Disk Graphs
A unit disk graph is the intersection graph of unit disks in the euclidean plane. We present a polynomial-time approximation scheme for the maximum weight independent set problem i...
Tim Nieberg, Johann Hurink, Walter Kern