3471 search results - page 194 / 695 » Obstacle Numbers of Graphs |
139
Voted
STACS
2007
Springer
15 years 11 months ago
2007
Springer
Abstract. The perfect matching problem is known to be in ¶, in randomized NC, and it is hard for NL. Whether the perfect matching problem is in NC is one of the most prominent ope...
131
click to vote
ARITH
2005
IEEE
15 years 10 months ago
2005
IEEE
We present a radix-2 online computational scheme for evaluating multinomials in a fixed-point number representation system. Its main advantage is that it can adapt to any evaluat...
132
click to vote
AINA
2010
IEEE
15 years 9 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...
134
click to vote
ICFEM
2009
Springer
15 years 9 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...
168
click to vote
ALGORITHMICA
2008
15 years 5 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...