Sciweavers

1327 search results - page 138 / 266
» Path following algorithm for the graph matching problem
Sort
View
139
Voted
ICNP
2002
IEEE
15 years 9 months ago
Routing Bandwidth Guaranteed Paths with Local Restoration in Label Switched Networks
The emerging Multi-Protocol Label Switching (MPLS) networks enable network service providers to route bandwidth guaranteed paths between customer sites [3, 2, 8, 5]. This basic La...
Erran L. Li, Milind M. Buddhikot, Chandra Chekuri,...
AC
2000
Springer
15 years 8 months ago
Graph-Theoretical Methods in Computer Vision
The management of large databases of hierarchical (e.g., multi-scale or multilevel) image features is a common problem in object recognition. Such structures are often represented ...
Ali Shokoufandeh, Sven J. Dickinson
132
Voted
ESOP
2010
Springer
15 years 8 months ago
CFA2: A Context-Free Approach to Control-Flow Analysis
Abstract. In a functional language, the dominant control-flow mechanism is function call and return. Most higher-order flow analyses, including k-CFA, do not handle call and retu...
Dimitrios Vardoulakis, Olin Shivers
ALGORITHMICA
2007
86views more  ALGORITHMICA 2007»
15 years 4 months ago
Detecting Holes and Antiholes in Graphs
In this paper we study the problems of detecting holes and antiholes in general undirected graphs, and we present algorithms for these problems. For an input graph G on n vertices ...
Stavros D. Nikolopoulos, Leonidas Palios
136
Voted
ESA
2001
Springer
105views Algorithms» more  ESA 2001»
15 years 8 months ago
On the Parameterized Complexity of Layered Graph Drawing
We consider graph drawings in which vertices are assigned to layers and edges are drawn as straight line-segments between vertices on adjacent layers. We prove that graphs admittin...
Vida Dujmovic, Michael R. Fellows, Michael T. Hall...