2612 search results - page 145 / 523 » Switching Graphs and Their Complexity |
134
click to vote
BPM
2009
Springer
15 years 10 months ago
2009
Springer
We investigate the problem of ranking all process models in a repository according to their similarity with respect to a given process model. We focus specifically on the applicat...
117
click to vote
WAW
2009
Springer
15 years 10 months ago
2009
Springer
The Modularity-Q measure of community structure is known to falsely ascribe community structure to random graphs, at least when it is naively applied. Although Q is motivated by a ...
135
click to vote
ESA
2009
Springer
15 years 10 months ago
2009
Springer
In this paper we present an O(n log n) algorithm for finding a maximum flow in a directed planar graph, where the vertices are subject to capacity constraints, in addition to the...
156
Voted
ICPR
2008
IEEE
15 years 10 months ago
2008
IEEE
This paper presents a novel graph cut based segmentation approach with shape priors. The model incorporates statistical shape prior information with the active contour without edg...
131
click to vote
ISAAC
2007
Springer
15 years 10 months ago
2007
Springer
The problem of maintaining a representation of a dynamic graph as long as a certain property is satisfied has recently been considered for a number of properties. This paper prese...