Sciweavers

4171 search results - page 132 / 835
» Choice numbers of graphs
Sort
View
ICCV
2009
IEEE
1714views Computer Vision» more  ICCV 2009»
16 years 11 months ago
Power watersheds: a new image segmentation framework extending graph cuts, random walker and optimal spanning forest
In this work, we extend a common framework for seeded image segmentation that includes the graph cuts, ran- dom walker, and shortest path optimization algorithms. Viewing an ima...
Camille Couprie, Leo Grady, Laurent Najman, Hugues...
KBSE
2003
IEEE
15 years 11 months ago
Analysis of Inconsistency in Graph-Based Viewpoints: A Category-Theoretic Approach
Eliciting the requirements for a proposed system typically involves different stakeholders with different expertise, responsibilities, and perspectives. Viewpoints-based approache...
Mehrdad Sabetzadeh, Steve M. Easterbrook
GBRPR
2007
Springer
16 years 18 days ago
Bipartite Graph Matching for Computing the Edit Distance of Graphs
In the field of structural pattern recognition graphs constitute a very common and powerful way of representing patterns. In contrast to string representations, graphs allow us to ...
Kaspar Riesen, Michel Neuhaus, Horst Bunke
DAM
1999
128views more  DAM 1999»
15 years 6 months ago
Graph Classes Between Parity and Distance-hereditary Graphs
Several graph problems (e.g., steiner tree, connected domination, hamiltonian path, and isomorphism problem), which can be solved in polynomial time for distance-hereditary graphs...
Serafino Cicerone, Gabriele Di Stefano
DM
2007
103views more  DM 2007»
15 years 6 months ago
Minimum cycle bases of graphs on surfaces
In this paper we study the cycle base structures of embedded graphs on surfaces. We first give a sufficient and necessary condition for a set of facial cycles to be contained in ...
Han Ren, Mo Deng