1736 search results - page 307 / 348 » The rank-width of Directed Graphs |
124
click to vote
ALGORITHMICA
2006
15 years 19 days ago
2006
We provide combinatorial algorithms for the unsplittable flow problem (UFP) that either match or improve the previously best results. In the UFP we are given a (possibly directed)...
101
click to vote
CAGD
2006
15 years 19 days ago
2006
We describe how some simple properties of discrete one-forms directly relate to some old and new results concerning the parameterization of 3D mesh data. Our first result is an ea...
104
Voted
CAL
2006
15 years 18 days ago
2006
Instruction-level traces are widely used for program and hardware analysis. However, program traces for just a few seconds of execution are enormous, up to several terabytes in siz...
124
click to vote
CONSTRAINTS
2006
15 years 18 days ago
2006
Abstract. Constraint Programming (CP) offers a rich modeling language of constraints embedding efficient algorithms to handle complex and heterogeneous combinatorial problems. To s...
IJAR
2008
15 years 17 days ago
2008
This paper presents a family of algorithms for approximate inference in credal networks (that is, models based on directed acyclic graphs and set-valued probabilities) that contai...