5889 search results - page 965 / 1178 » Graph Layout Problems |
159
click to vote
APPROX
2010
Springer
15 years 8 months ago
2010
Springer
We consider the question: What is the maximum flow achievable in a network if the flow must be decomposable into a collection of edgedisjoint paths? Equivalently, we wish to find a...
144
click to vote
ACL
2008
15 years 8 months ago
2008
In this paper, we study the problem of summarizing email conversations. We first build a sentence quotation graph that captures the conversation structure among emails. We adopt t...
168
click to vote
AAAI
2010
15 years 8 months ago
2010
Dominance testing, the problem of determining whether an outcome is preferred over another, is of fundamental importance in many applications. Hence, there is a need for algorithm...
138
click to vote
DAGSTUHL
2007
15 years 8 months ago
2007
Automated political districting shares with electronic voting the aim of preventing electoral manipulation and pursuing an impartial electoral mechanism. Political districting can...
169
click to vote
IJCAI
2007
15 years 7 months ago
2007
Some Statistical Software Testing approaches rely on sampling the feasible paths in the control flow graph of the program; the difficulty comes from the tiny ratio of feasible p...