Sciweavers

601 search results - page 102 / 121
» Edge-dominating cycles in graphs
Sort
View
BMCBI
2007
118views more  BMCBI 2007»
13 years 8 months ago
A topological algorithm for identification of structural domains of proteins
Background: Identification of the structural domains of proteins is important for our understanding of the organizational principles and mechanisms of protein folding, and for ins...
Frank Emmert-Streib, Arcady R. Mushegian
SASO
2008
IEEE
14 years 3 months ago
Towards Desynchronization of Multi-hop Topologies
In this paper we study desynchronization, a closelyrelated primitive to graph coloring. A valid graph coloring is an assignment of colors to nodes such that no node’s color is t...
Julius Degesys, Radhika Nagpal
DCC
2004
IEEE
14 years 8 months ago
LDPC Codes from Triangle-Free Line Sets
We study sets of lines of AG(n, q) and PG(n, q) with the property that no three lines form a triangle. As a result the associated point-line incidence graph contains no 6-cycles a...
Keith E. Mellinger
SOFSEM
2010
Springer
14 years 3 months ago
On a Labeled Vehicle Routing Problem
In this paper, we study the complexity and (in)approximability of the minimum label vehicle routing problem. Given a simple complete graph G = (V, E) containing a special vertex 0 ...
Hatem Chatti, Laurent Gourvès, Jér&o...
CDC
2008
IEEE
109views Control Systems» more  CDC 2008»
14 years 3 months ago
Control of acyclic formations of mobile autonomous agents
— This paper proposes distributed control laws for maintaining the shape of a formation of mobile autonomous agents in the plane for which the desired shape is defined in terms ...
Ming Cao, Brian D. O. Anderson, A. Stephen Morse, ...