1101 search results - page 67 / 221 » An Algorithm for the Graph Crossing Number Problem |
109
Voted
SIGMOD
2004
ACM
16 years 2 months ago
2004
ACM
Trees and graphs are widely used to model biological databases. Providing efficient algorithms to support tree-based or graph-based querying is therefore an important issue. In th...
109
click to vote
FSTTCS
2009
Springer
15 years 9 months ago
2009
Springer
We introduce and study the donation center location problem, which has an additional application in network testing and may also be of independent interest as a general graph-theor...
109
Voted
ESA
2009
Springer
15 years 9 months ago
2009
Springer
Abstract. The input of the Edge Multicut problem consists of an undirected graph G and pairs of terminals {s1, t1}, . . . , {sm, tm}; the task is to remove a minimum set of edges s...
140
Voted
ICALP
2011
Springer
14 years 6 months ago
2011
Springer
Competitive analysis is the established tool for measuring the output quality of algorithms that work in an online environment. Recently, the model of advice complexity has been in...
119
click to vote
JMLR
2006
15 years 2 months ago
2006
We discuss the problem of learning to rank labels from a real valued feedback associated with each label. We cast the feedback as a preferences graph where the nodes of the graph ...