4171 search results - page 206 / 835 » Choice numbers of graphs |
162
click to vote
AINA
2010
IEEE
15 years 11 months ago
2010
IEEE
—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...
166
click to vote
ICFEM
2009
Springer
15 years 11 months ago
2009
Springer
Structural constraint solving allows finding object graphs that satisfy given constraints, thereby enabling software reliability tasks, such as systematic testing and error recove...
211
click to vote
ALGORITHMICA
2008
15 years 6 months 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...
166
click to vote
DAM
2000
15 years 6 months ago
2000
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;:::...
236
click to vote
TKDE
2012
13 years 9 months ago
2012
— This paper presents a method for identifying a set of dense subgraphs of a given sparse graph. Within the main applications of this “dense subgraph problem”, the dense subg...