3105 search results - page 338 / 621 » The Path-Packing Structure of Graphs |
128
click to vote
CORR
2010
Springer
15 years 3 months ago
2010
Springer
The neighbourhood function NG(t) of a graph G gives, for each t ∈ N, the number of pairs of nodes x, y such that y is reachable from x in less that t hops. The neighbourhood fun...
166
click to vote
WWW
2008
ACM
16 years 5 months ago
2008
ACM
Automatic topic discovery and tracking on web-shared videos can greatly benefit both web service providers and end users. Most of current solutions of topic detection and tracking...
123
click to vote
COCOON
2007
Springer
15 years 11 months ago
2007
Springer
An r-component connected coloring of a graph is a coloring of the vertices so that each color class induces a subgraph having at most r connected components. The concept has been w...
153
Voted
ATMOS
2007
15 years 6 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...
164
click to vote
ALMOB
2006
15 years 4 months ago
2006
Given a set S of n locally aligned sequences, it is a needed prerequisite to partition it into groups of very similar sequences to facilitate subsequent computations, such as the ...