374 search results - page 4 / 75 » Stochastic Minority on Graphs |
133
Voted
ISAAC
2010
Springer
14 years 10 months ago
2010
Springer
A permutation graph is an intersection graph of segments lying between two parallel lines. A Seidel complementation of a finite graph at a vertex v consists in complementing the ed...
89
Voted
DM
2010
15 years 24 days ago
2010
A graph G is loosely-c-connected, or -c-connected, if there exists a number d depending on G such that the deletion of fewer than c vertices from G leaves precisely one infinite co...
98
Voted
DM
2006
15 years 23 days ago
2006
In this paper we continue our investigations from [HM01] regarding spanning subgraphs which imply the existence of cycle double covers. We prove that if a cubic graph G has a spann...
115
click to vote
STOC
1990
ACM
15 years 4 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...
110
Voted
ECCC
2008
15 years 24 days ago
2008
Testing a property P of graphs in the bounded degree model is the following computational problem: given a graph G of bounded degree d we should distinguish (with probability 0.9,...