Sciweavers

221 search results - page 2 / 45
» Graph matching with type constraints on nodes and edges
Sort
View
ENTCS
2002
90views more  ENTCS 2002»
13 years 7 months ago
Specifying Graph-like Diagrams with DIAGEN
ended abstract demonstrates that creating editors and environments for visual languages becomes considerably easier when restricting the class of visual languages. The presented a...
Mark Minas
ESA
2005
Springer
176views Algorithms» more  ESA 2005»
14 years 1 months ago
On Degree Constrained Shortest Paths
Abstract. Traditional shortest path problems play a central role in both the design and use of communication networks and have been studied extensively. In this work, we consider a...
Samir Khuller, Kwangil Lee, Mark A. Shayman
FLAIRS
2007
13 years 10 months ago
Inference of Edge Replacement Graph Grammars
We describe an algorithm and experiments for inference of edge replacement graph grammars. This method generates candidate recursive graph grammar productions based on isomorphic ...
Jacek P. Kukluk, Lawrence B. Holder, Diane J. Cook
IJCV
2002
156views more  IJCV 2002»
13 years 7 months ago
Trinocular Stereo Using Shortest Paths and the Ordering Constraint
This paper describes a new algorithm for disparity estimation using trinocular stereo. The three cameras are placed in a right angled configuration. A graph is then constructed wh...
Motilal Agrawal
CORR
2011
Springer
199views Education» more  CORR 2011»
12 years 11 months ago
Maximum Gain Round Trips with Cost Constraints
Searching for optimal ways in a network is an important task in multiple application areas such as social networks, co-citation graphs or road networks. In the majority of applicat...
Franz Graf, Hans-Peter Kriegel, Matthias Schubert