553 search results - page 5 / 111 » Cover Contact Graphs |
STOC
2007
ACM
14 years 7 months ago
2007
ACM
STOC
2010
ACM
14 years 7 days ago
2010
ACM
We consider the problem of maintaining a large matching and a small vertex cover in a dynamically changing graph. Each update to the graph is either an edge deletion or an edge in...
DAM
1999
13 years 7 months ago
1999
The definitions of four previously studied parameters related to total coverings and total matchings of graphs can be restricted, thereby obtaining eight parameters related to cov...
ADHOCNOW
2008
Springer
14 years 1 months ago
2008
Springer
We present 1 − approximation algorithms for the maximum matching problem in location aware unit disc graphs and in growth-bounded graphs. The algorithm for unit disk graph is loc...
JCT
2007
13 years 7 months ago
2007
The preferential attachment graph Gm(n) is a random graph formed by adding a new vertex at each time step, with m edges which point to vertices selected at random with probability...