Sciweavers

3211 search results - page 181 / 643
» On the Grundy Number of a Graph
Sort
View
AINA
2010
IEEE
15 years 11 months ago
The Power of Orientation in Symmetry-Breaking
—Symmetry breaking is a fundamental operation in distributed computing. It has applications to important problems such as graph vertex and edge coloring, maximal independent sets...
Satya Krishna Pindiproli, Kishore Kothapalli
ICFEM
2009
Springer
15 years 11 months ago
An Empirical Study of Structural Constraint Solving Techniques
Structural constraint solving allows finding object graphs that satisfy given constraints, thereby enabling software reliability tasks, such as systematic testing and error recove...
Junaid Haroon Siddiqui, Sarfraz Khurshid
ALGORITHMICA
2008
111views more  ALGORITHMICA 2008»
15 years 6 months ago
Fixed-Parameter Complexity of Minimum Profile Problems
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...
Gregory Gutin, Stefan Szeider, Anders Yeo
DAM
2000
97views more  DAM 2000»
15 years 6 months ago
Algorithms and obstructions for linear-width and related search parameters
The linear-width of a graph G is de ned to be the smallest integer k such that the edges of G can be arranged in a linear ordering e1;:::;er in such a way that for every i = 1;:::...
Dimitrios M. Thilikos
LAWEB
2006
IEEE
16 years 14 days ago
Where and How Duplicates Occur in the Web
In this paper we study duplicates on the Web, using collections containing documents of all sites under the .cl domain that represent accurate and representative subsets of the We...
Álvaro R. Pereira Jr., Ricardo A. Baeza-Yat...