150 search results - page 15 / 30 » Polynomial graph invariants from homomorphism numbers |
66
Voted
JAL
2002
14 years 9 months ago
2002
Kayles is a combinatorial game on graphs. Two players select alternatingly a vertex from a given graph G - a chosen vertex may not be adjacent or equal to an already chosen vertex...
116
click to vote
STOC
2010
ACM
15 years 1 months ago
2010
ACM
Consider the following two-player communication process to decide a language L: The first player holds the entire input x but is polynomially bounded; the second player is computa...
117
click to vote
DCOSS
2008
Springer
14 years 11 months ago
2008
Springer
We present the first local approximation schemes for maximum independent set and minimum vertex cover in unit disk graphs. In the graph model we assume that each node knows its geo...
STOC
1990
ACM
15 years 1 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...
CONCUR
2006
Springer
15 years 1 months ago
2006
Springer
We propose the notions of "density" and "connectivity" of infinite process graphs and investigate them in the context of the wellknown process algebras BPA and ...