3105 search results - page 298 / 621 » The Path-Packing Structure of Graphs |
157
click to vote
KDD
2009
ACM
15 years 9 months ago
2009
ACM
Recent innovations have resulted in a plethora of social applications on the Web, such as blogs, social networks, and community photo and video sharing applications. Such applicat...
149
click to vote
SODA
2007
ACM
15 years 6 months ago
2007
ACM
We obtain the first approximation algorithm for finding the k-simple shortest paths connecting a pair of vertices in a weighted directed graph. Our algorithm is deterministic an...
136
Voted
AAAI
1990
15 years 5 months ago
1990
Bandwidth is a fundamental concept in graph theory which has some surprising applications to a class of AI search problems. Graph bandwidth provides a link between the syntactic s...
165
click to vote
CGF
2008
15 years 4 months ago
2008
Most graph visualization techniques focus on the structure of graphs and do not offer support for dealing with node attributes and edge labels. To enable users to detect relations...
136
click to vote
DAM
2008
15 years 4 months ago
2008
Let G = (V + s, E) be a 2-edge-connected graph with a designated vertex s. A pair of edges rs, st is called admissible if splitting off these edges (replacing rs and st by rt) pre...