Sciweavers

3105 search results - page 2 / 621
» The Path-Packing Structure of Graphs
Sort
View
ICFP
2012
ACM
11 years 9 months ago
Functional programming with structured graphs
This paper presents a new functional programming model for graph structures called structured graphs. Structured graphs extend conventional algebraic datatypes with explicit defi...
Bruno C. d. S. Oliveira, William R. Cook
TSP
2011
197views more  TSP 2011»
13 years 2 months ago
Group Object Structure and State Estimation With Evolving Networks and Monte Carlo Methods
—This paper proposes a technique for motion estimation of groups of targets based on evolving graph networks. The main novelty over alternative group tracking techniques stems fr...
Amadou Gning, Lyudmila Mihaylova, Simon Maskell, S...
WAOA
2005
Springer
177views Algorithms» more  WAOA 2005»
14 years 26 days ago
Approximation and Complexity of k-Splittable Flows
Given a graph with a source and a sink node, the NP–hard maximum k–splittable flow (MkSF) problem is to find a flow of maximum value with a flow decomposition using at most...
Ronald Koch, Martin Skutella, Ines Spenke
DAM
2011
13 years 2 months ago
Powers of cycles, powers of paths, and distance graphs
In 1988, Golumbic and Hammer characterized powers of cycles, relating them to circular-arc graphs. We extend their results and propose several further structural characterizations ...
Min Chih Lin, Dieter Rautenbach, Francisco J. Soul...
JMLR
2010
113views more  JMLR 2010»
13 years 2 months ago
Optimal Search on Clustered Structural Constraint for Learning Bayesian Network Structure
We study the problem of learning an optimal Bayesian network in a constrained search space; skeletons are compelled to be subgraphs of a given undirected graph called the super-st...
Kaname Kojima, Eric Perrier, Seiya Imoto, Satoru M...