1101 search results - page 81 / 221 » An Algorithm for the Graph Crossing Number Problem |
146
click to vote
INFOVIS
2005
IEEE
15 years 10 months ago
2005
IEEE
Cartographers have long used flow maps to show the movement of objects from one location to another, such as the number of people in a migration, the amount of goods being traded,...
141
click to vote
ICCS
2007
Springer
15 years 8 months ago
2007
Springer
Knowledge representation (KR) is used to store and retrieve meaningful data. This data is saved using dynamic data structures that are suitable for the style of KR being implemente...
169
click to vote
INFOCOM
2009
IEEE
15 years 11 months ago
2009
IEEE
— The automatic detection of failures in IP paths is an essential step for operators to perform diagnosis or for overlays to adapt. We study a scenario where a set of monitors se...
115
click to vote
WWW
2009
ACM
16 years 5 months ago
2009
ACM
This paper identifies and explores the problem of seed selection in a web-scale crawler. We argue that seed selection is not a trivial but very important problem. Selecting proper...
138
Voted
JCO
2010
15 years 3 months ago
2010
Abstract Polynomial-time data reduction is a classical approach to hard graph problems. Typically, particular small subgraphs are replaced by smaller gadgets. We generalize this ap...