Sciweavers

829 search results - page 7 / 166
» Distance domination-critical graphs
Sort
View
DMGT
2011
94views more  DMGT 2011»
14 years 29 days ago
Closed k-stop distance in graphs
The Traveling Salesman Problem (TSP) is still one of the most researched topics in computational mathematics, and we introduce a variant of it, namely the study of the closed k-wa...
Grady Bullington, Linda Eroh, Ralucca Gera, Steven...
ICPR
2008
IEEE
15 years 3 months ago
An approach for video cut detection using bipartite graph matching as dissimilarity distance
The video segmentation problem consists in the identification of the boundary between consecutive shots. When two consecutive frames are similar, they are considered to be in the...
Silvio Jamil Ferzoli Guimarães, Zenilton Kl...
AUSAI
2009
Springer
15 years 4 months ago
A Graph Distance Based Structural Clustering Approach for Networks
In the era of information explosion, structured data emerge on a large scale. As a description of structured data, network has drawn attention of researchers in many subjects. Netw...
Xin Su, Chunping Li
WADS
2007
Springer
104views Algorithms» more  WADS 2007»
15 years 3 months ago
Faster Approximation of Distances in Graphs
Let G = (V, E) be an weighted undirected graph on n vertices and m edges, and let dG be its shortest path metric. We present two simple deterministic algorithms for approximating ...
Piotr Berman, Shiva Prasad Kasiviswanathan
GMP
2006
IEEE
120views Solid Modeling» more  GMP 2006»
15 years 3 months ago
Spectral Sequencing Based on Graph Distance
The construction of linear mesh layouts has found various applications, such as implicit mesh filtering and mesh streaming, where a variety of layout quality criteria, e.g., span ...
Rong Liu, Hao Zhang 0002, Oliver van Kaick