4865 search results - page 340 / 973 » The Complexity of Graph Connectivity |
214
click to vote
ATMOS
2010
15 years 5 months ago
2010
To model and solve optimization problems arising in public transportation, data about the passengers is necessary and has to be included in the models in any phase of the planning...
193
click to vote
ICDE
2010
IEEE
16 years 6 months ago
2010
IEEE
Abstract-- This demonstration presents an interactive provenance browser for visualizing and querying data dependency (lineage) graphs produced by scientific workflow runs. The bro...
182
click to vote
BPM
2009
Springer
16 years 1 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...
161
click to vote
WAW
2009
Springer
16 years 1 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 ...
175
Voted
ESA
2009
Springer
16 years 1 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...