686 search results - page 61 / 138 » Packing Cycles in Graphs |
61
Voted
CDC
2008
IEEE
15 years 7 months ago
2008
IEEE
— This paper examines stability properties of distance-based formations. These are formations encoded by inter-agent relative distances. A negative gradient control law is propos...
106
Voted
DM
2010
14 years 10 months ago
2010
A dodecagon quadrangle is the graph consisting of two cycles: a 12-cycle (x1, x2, ..., x12) and a 4-cycle (x1, x4, x7, x10). A dodecagon quadrangle system of order n and index [D...
107
click to vote
GD
2008
Springer
15 years 1 months ago
2008
Springer
Abstract. We present a linear-time algorithm for solving the simultaneous embedding problem with fixed edges (SEFE) for a planar graph and a pseudoforest (a graph with at most one...
82
Voted
FCT
2005
Springer
15 years 6 months ago
2005
Springer
Graph homomorphism, also called H-coloring, is a natural generalization of graph coloring: There is a homomorphism from a graph G to a complete graph on k vertices if and only if ...
99
Voted
STOC
2003
ACM
16 years 25 days ago
2003
ACM
Given an undirected graph or an Eulerian directed graph G and a subset S of its vertices, we show how to determine the edge connectivity C of the vertices in S in time O(C3 n log ...