13 search results - page 3 / 3 » Parameterized Graph Editing with Chosen Vertex Degrees |
SODA
2010
ACM
13 years 6 months ago
2010
ACM
We consider the following marking process (rw-rand) made by a random walk on an undirected graph G. Upon arrival at a vertex v, it marks v if unmarked and otherwise it marks a ran...
CPC
2007
13 years 7 months ago
2007
We study a dynamically evolving random graph which adds vertices and edges using preferential attachment and is “attacked by an adversary”. At time t, we add a new vertex xt a...
WADS
2009
Springer
14 years 2 months ago
2009
Springer
We present the first thorough theoretical analysis of the Transitivity Editing problem on digraphs. Herein, the task is to perform a minimum number of arc insertions or deletions ...