684 search results - page 36 / 137 » A characterization of b-perfect graphs |
162
click to vote
FOCS
2007
IEEE
16 years 15 days ago
2007
IEEE
Consider a collection of random variables attached to the vertices of a graph. The reconstruction problem requires to estimate one of them given ‘far away’ observations. Sever...
141
click to vote
ISAAC
2007
Springer
16 years 10 days ago
2007
Springer
In an edge deletion problem one is asked to delete at most k edges from a given graph such that the resulting graph satisfies a certain property. In this work, we study four NP-co...
148
click to vote
CORR
2010
Springer
15 years 6 months ago
2010
Springer
The intrinsically secure communications graph (-graph) is a random graph which captures the connections that can be securely established over a large-scale network, in the presence...
166
click to vote
ACTA
2006
15 years 6 months ago
2006
Linearly bounded Turing machines have been mainly studied as acceptors for context-sensitive languages. We define a natural family of canonical infinite automata representing their...
172
click to vote
JGT
2007
15 years 6 months ago
2007
A transition system T of an Eulerian graph G is a family of partitions of the edges incident to each vertex of G into transitions i.e. subsets of size two. A circuit decomposition...