Sciweavers

3757 search results - page 450 / 752
» The overlap number of a graph
Sort
View
COCOON
2005
Springer
16 years 6 days ago
Bounded Degree Closest k-Tree Power Is NP-Complete
Abstract. An undirected graph G = (V, E) is the k-power of an undirected tree T = (V, E ) if (u, v) ∈ E iff u and v are connected by a path of length at most k in T. The tree T ...
Michael Dom, Jiong Guo, Rolf Niedermeier
STACS
2005
Springer
16 years 4 days ago
Connectivity for Wireless Agents Moving on a Cycle or Grid
Abstract. We present a mathematical model to analyse the establishment and maintenance of communication between mobile agents. We assume that the agents move through a fixed envir...
Josep Díaz-Giménez, Xavier Pé...
GECCO
2003
Springer
15 years 12 months ago
Problem-Independent Schema Synthesis for Genetic Algorithms
Abstract. As a preprocessing for genetic algorithms, static reordering helps genetic algorithms effectively create and preserve high-quality schemata, and consequently improves th...
Yong-Hyuk Kim, Yung-Keun Kwon, Byung Ro Moon
COCOON
2010
Springer
15 years 11 months ago
Imbalance Is Fixed Parameter Tractable
In the Imbalance Minimization problem we are given a graph G = (V, E) and an integer b and asked whether there is an ordering v1 . . . vn of V such that the sum of the imbalance of...
Daniel Lokshtanov, Neeldhara Misra, Saket Saurabh
155
Voted
ENTER
2009
Springer
15 years 11 months ago
On the Importance of Hyperlinks: A Network Science Approach
Hyperlinks are the essence of the World Wide Web. Their importance is very high due to their ability to provide a visitor with a wealth of good quality information and for the rol...
Rodolfo Baggio, Magda Antonioli Corigliano