Sciweavers

1736 search results - page 179 / 348
» On antimagic directed graphs
Sort
View
COR
2006
94views more  COR 2006»
15 years 6 months ago
A comparison of two different formulations for arc routing problems on mixed graphs
Arc Routing Problems on mixed graphs have been modelled in the literature either using just one variable per edge or associating to each edge two variables, each one representing ...
Angel Corberán, Enrique Mota, José M...
COMBINATORICA
2007
81views more  COMBINATORICA 2007»
15 years 6 months ago
Total domination of graphs and small transversals of hypergraphs
The main result of this paper is that every 4-uniform hypergraph on n vertices and m edges has a transversal with no more than (5n + 4m)/21 vertices. In the particular case n = m,...
Stéphan Thomassé, Anders Yeo
SSD
1999
Springer
116views Database» more  SSD 1999»
15 years 10 months ago
Generalizing Graphs Using Amalgamation and Selection
This work is a contribution to the developing literature on multi-resolution data models. It considers operations for model-oriented generalization in the case where the underlying...
John G. Stell, Michael F. Worboys
ICCV
2003
IEEE
16 years 8 months ago
Gaze Manipulation for One-to-one Teleconferencing
A new algorithm is proposed for novel view generation in one-toone teleconferencing applications. Given the video streams acquired by two cameras placed on either side of a comput...
Antonio Criminisi, Jamie Shotton, Andrew Blake, Ph...
RECOMB
2006
Springer
16 years 6 months ago
Probabilistic Paths for Protein Complex Inference
Understanding how individual proteins are organized into complexes and pathways is a significant current challenge. We introduce new algorithms to infer protein complexes by combin...
Hailiang Huang, Lan V. Zhang, Frederick P. Roth, J...