Sciweavers

6740 search results - page 228 / 1348
» An s -Hamiltonian Line Graph Problem
Sort
View
CORR
2010
Springer
80views Education» more  CORR 2010»
13 years 11 months ago
Many-to-Many Graph Matching: a Continuous Relaxation Approach
Graphs provide an efficient tool for object representation in various computer vision applications. Once graph-based representations are constructed, an important question is how ...
Mikhail Zaslavskiy, Francis Bach, Jean-Philippe Ve...
SDM
2009
SIAM
114views Data Mining» more  SDM 2009»
14 years 8 months ago
Top-k Correlative Graph Mining.
Correlation mining has been widely studied due to its ability for discovering the underlying occurrence dependency between objects. However, correlation mining in graph databases ...
Yiping Ke, James Cheng, Jeffrey Xu Yu
GG
2004
Springer
14 years 4 months ago
Analysis of Metabolic Pathways by Graph Transformation
Biochemical pathways, such as metabolic, regulatory, and signal transduction pathways, constitute complex networks of functional and physical interactions between molecular species...
Francesc Rosselló, Gabriel Valiente
SWAT
2004
Springer
171views Algorithms» more  SWAT 2004»
14 years 4 months ago
Connectivity of Graphs Under Edge Flips
We study the following problem: Given a set V of n vertices and a set E of m edge pairs, we define a graph family G(V, E) as the set of graphs that have vertex set V and contain ...
Norbert Zeh
GD
2006
Springer
14 years 2 months ago
Parameterized st -Orientations of Graphs: Algorithms and Experiments
st-orientations (st-numberings) or bipolar orientations of undirected graphs are central to many graph algorithms and applications. Several algorithms have been proposed in the pas...
Charalampos Papamanthou, Ioannis G. Tollis