3958 search results - page 78 / 792 » Dynamic Graph Algorithms with Applications |
127
click to vote
ESA
2004
Springer
15 years 10 months ago
2004
Springer
We show the first o(n2 ) algorithm for coloring vertices of trianglefree planar graphs using three colors. The time complexity of the algorithm is O(n log n). Our approach can be ...
156
click to vote
FSTTCS
2009
Springer
15 years 9 months ago
2009
Springer
We introduce a graph clustering problem motivated by a stream processing application. Input to our problem is an undirected graph with vertex and edge weights. A cluster is a subse...
136
click to vote
IAJIT
2008
15 years 4 months ago
2008
: This paper presents a graph-coloring-based algorithm for the exam scheduling application, with the objective of achieving fairness, accuracy, and optimal exam time period. Throug...
135
click to vote
WWW
2008
ACM
16 years 5 months ago
2008
ACM
We study the Cost-Per-Action or Cost-Per-Acquisition (CPA) charging scheme in online advertising. In this scheme, instead of paying per click, the advertisers pay only when a user...
162
click to vote
ICDE
2011
IEEE
14 years 8 months ago
2011
IEEE
—It is increasingly common to find graphs in which edges bear different types, indicating a variety of relationships. For such graphs we propose a class of reachability queries ...