Sciweavers

469 search results - page 24 / 94
» Directed Graphs of Entanglement Two
Sort
View
IPPS
2006
IEEE
14 years 1 months ago
Towards a parallel framework of grid-based numerical algorithms on DAGs
This paper presents a parallel framework of grid-based numerical algorithms where data dependencies between grid zones can be modeled by a directed acyclic graph (DAG). It consist...
Zeyao Mo, Aiqing Zhang, Xiaolin Cao
AAIM
2007
Springer
123views Algorithms» more  AAIM 2007»
13 years 11 months ago
Efficient Algorithms for k -Disjoint Paths Problems on DAGs
Given an acyclic directed graph and two distinct nodes s and t, we consider the problem of finding k disjoint paths from s to t satisfying some objective. We consider four objectiv...
Rudolf Fleischer, Qi Ge, Jian Li, Hong Zhu
DAM
2007
97views more  DAM 2007»
13 years 7 months ago
On Sturmian graphs
In this paper we define Sturmian graphs and we prove that all of them have a certain “counting” property. We show deep connections between this counting property and two conj...
Chiara Epifanio, Filippo Mignosi, Jeffrey Shallit,...
CVPR
2005
IEEE
14 years 9 months ago
Energy Minimization via Graph Cuts: Settling What is Possible
The recent explosion of interest in graph cut methods in computer vision naturally spawns the question: what energy functions can be minimized via graph cuts? This question was fi...
Daniel Freedman, Petros Drineas
DIS
2004
Springer
14 years 28 days ago
Predictive Graph Mining
Abstract. Graph mining approaches are extremely popular and effective in molecular databases. The vast majority of these approaches first derive interesting, i.e. frequent, patte...
Andreas Karwath, Luc De Raedt