Sciweavers

4137 search results - page 496 / 828
» On the number of matchings of a tree
Sort
View
DAM
2008
108views more  DAM 2008»
15 years 6 months ago
On the complexity of the multicut problem in bounded tree-width graphs and digraphs
Given an edge- or vertex-weighted graph or digraph and a list of source-sink pairs, the minimum multicut problem consists in selecting a minimum weight set of edges or vertices wh...
Cédric Bentz
GC
2008
Springer
15 years 6 months ago
A Bijection for Eulerian-equivalence Classes of Totally Cyclic Orientations
Gioan showed that the number of cycle reversing classes of totally cyclic orientations of a given graph can be calculated as an evaluation of the corresponding Tutte polynomial. We...
Beifang Chen, Arthur L. B. Yang, Terence Y. J. Zha...
151
Voted
JFR
2008
87views more  JFR 2008»
15 years 6 months ago
Hough based terrain classification for realtime detection of drivable ground
The usability of mobile robots for surveillance, search and rescue missions can be significantly improved by intelligent functionalities decreasing the cognitive load on the opera...
Jann Poppinga, Andreas Birk 0002, Kaustubh Pathak
JCT
2007
110views more  JCT 2007»
15 years 6 months ago
Bijective counting of Kreweras walks and loopless triangulations
Abstract. We consider lattice walks in the plane starting at the origin, remaining in the first quadrant i, j ≥ 0 and made of West, South and North-East steps. In 1965, Germain ...
Olivier Bernardi
TOG
2008
88views more  TOG 2008»
15 years 6 months ago
Interaction patches for multi-character animation
We propose a data-driven approach to automatically generate a scene where tens to hundreds of characters densely interact with each other. During off-line processing, the close in...
Hubert P. H. Shum, Taku Komura, Masashi Shiraishi,...