540 search results - page 27 / 108 » New bounds on the edge number of a k-map graph |
TCS
2008
14 years 11 months ago
2008
Following the decontamination metaphor for searching a graph, we introduce a cleaning process, which is related to both the chip-firing game and edge searching. Brushes (instead o...
120
click to vote
ICALP
2009
Springer
16 years 3 days ago
2009
Springer
We develop new structural results for apex-minor-free graphs and show their power by developing two new approximation algorithms. The first is an additive approximation for colorin...
COCOON
2005
Springer
15 years 5 months ago
2005
Springer
Abstract. We present three streaming algorithms that ( , δ)− approximate 1 the number of triangles in graphs. Similar to the previous algorithms [3], the space usage of presente...
DM
2010
14 years 12 months ago
2010
For graphs of bounded maximum degree, we consider acyclic t-improper colourings, that is, colourings in which each bipartite subgraph consisting of the edges between two colour cl...
111
click to vote
IJCAI
2007
15 years 1 months ago
2007
In distributed combinatorial optimization problems, dynamic programming algorithms like DPOP ([Petcu and Faltings, 2005]) require only a linear number of messages, thus generating...