343 search results - page 36 / 69 » On Making Directed Graphs Transitive |
110
click to vote
WWW
2008
ACM
16 years 2 months ago
2008
ACM
With the explosive growth of Web and the recent development in digital media technology, the number of images on the Web has grown tremendously. Consequently, Web image clustering...
126
click to vote
PODC
2006
ACM
15 years 7 months ago
2006
ACM
Coloring the nodes of a graph with a small number of colors is one of the most fundamental problems in theoretical computer science. In this paper, we study graph coloring in a di...
122
click to vote
TKDE
2008
15 years 1 months ago
2008
Correlation mining has gained great success in many application domains for its ability to capture underlying dependencies between objects. However, research on correlation mining ...
127
click to vote
ATMOS
2007
15 years 3 months ago
2007
In railways systems the timetable is typically represented as a weighted digraph on which itinerary queries are answered by shortest path algorithms, usually running Dijkstra’s a...
129
click to vote
GIS
2007
ACM
15 years 5 months ago
2007
ACM
A frequent query in geospatial planning and decision making domains (e.g., emergency response, data acquisition, street cleaning), is to find an optimal traversal plan (OTP) that ...