91 search results - page 12 / 19 » Finding Independent Sets in Unions of Perfect Graphs |
STOC
1990
ACM
13 years 11 months ago
1990
ACM
ions (Extended Abstract) Noga Alon Paul Seymour Robin Thomas Let G be an n-vertex graph with nonnegative weights whose sum is 1 assigned to its vertices, and with no minor isomorp...
IPPS
2007
IEEE
14 years 1 months ago
2007
IEEE
In message-passing parallel applications, messages are not delivered in a strict order. In most applications, the computation results and the set of messages produced during the e...
CORR
2010
Springer
13 years 5 months ago
2010
Springer
In a previous work we introduced slice graphs as a way to specify both infinite languages of directed acyclic graphs (DAGs) and infinite languages of partial orders. Therein we fo...
ACCV
2010
Springer
13 years 2 months ago
2010
Springer
Spatiotemporal segmentation is an essential task for video analysis. The strong interconnection between finding an object's spatial support and finding its motion characterist...
COMBINATORICA
2007
13 years 7 months ago
2007
The k-th power of a graph G is the graph whose vertex set is V (G)k , where two distinct ktuples are adjacent iff they are equal or adjacent in G in each coordinate. The Shannon ...