Sciweavers

6740 search results - page 38 / 1348
» An s -Hamiltonian Line Graph Problem
Sort
View
BMCBI
2010
137views more  BMCBI 2010»
15 years 3 months ago
TreeGraph 2: Combining and visualizing evidence from different phylogenetic analyses
Background: Today it is common to apply multiple potentially conflicting data sources to a given phylogenetic problem. At the same time, several different inference techniques are...
Ben C. Stöver, Kai F. Müller
COCO
2010
Springer
131views Algorithms» more  COCO 2010»
15 years 16 days ago
On the Matching Problem for Special Graph Classes
An even cycle in a graph is called nice by Lov
Thanh Minh Hoang
IROS
2007
IEEE
129views Robotics» more  IROS 2007»
15 years 9 months ago
Decomposition of line segments into corner and statistical grown line features in an EKF-SLAM framework
Abstract— Robots are emerging from industrial plants toward every people’s daily life. Thus, navigation in and understanding of human related environments becomes a prerequisit...
Christian Pascal Connette, Oliver Meister, Martin ...
FSTTCS
2005
Springer
15 years 8 months ago
The Directed Planar Reachability Problem
We investigate the s-t-connectivity problem for directed planar graphs, which is hard for L and is contained in NL but is not known to be complete. We show that this problem is log...
Eric Allender, Samir Datta, Sambuddha Roy
SPLC
2010
15 years 4 months ago
Consistent Product Line Configuration across File Type and Product Line Boundaries
Creating a valid software configuration of a product line can require laborious customizations involving multiple configuration file types, such as feature models, domain-specific ...
Christoph Elsner, Peter Ulbrich, Daniel Lohmann, W...