Sciweavers

1664 search results - page 16 / 333
» Distance labeling in graphs
Sort
View
ICCV
2009
IEEE
16 years 4 months ago
Convex Optimization for Multi-Class Image Labeling with a Novel Family of Total Variation Based Regularizers
We introduce a linearly weighted variant of the total variation for vector fields in order to formulate regularizers for multi-class labeling problems with non-trivial interclass...
J. Lellmann, F. Becker, C. Schn¨orr
STACS
2010
Springer
15 years 6 months ago
Two-phase Algorithms for the Parametric Shortest Path Problem
Abstract. A parametric weighted graph is a graph whose edges are labeled with continuous real functions of a single common variable. For any instantiation of the variable, one obta...
Sourav Chakraborty, Eldar Fischer, Oded Lachish, R...
CIAC
1997
Springer
154views Algorithms» more  CIAC 1997»
15 years 4 months ago
Isomorphism for Graphs of Bounded Distance Width
In this paper, we study the Graph Isomorphism problem on graphs of bounded treewidth, bounded degree or bounded bandwidth. Graph Isomorphism can be solved in polynomial time for g...
Koichi Yamazaki, Hans L. Bodlaender, Babette de Fl...
EDBT
2009
ACM
241views Database» more  EDBT 2009»
15 years 6 months ago
GADDI: distance index based subgraph matching in biological networks
Currently, a huge amount of biological data can be naturally represented by graphs, e.g., protein interaction networks, gene regulatory networks, etc. The need for indexing large ...
Shijie Zhang, Shirong Li, Jiong Yang
APPML
2006
71views more  APPML 2006»
14 years 12 months ago
Distance distribution of nodes in star graphs
The purpose of the paper is to provide an answer to a long standing problem to compute the distance distribution among the nodes in a star graph, i.e., to compute the exact number...
L. Wang, S. Subramanian, Shahram Latifi, Pradip K....