1729 search results - page 245 / 346 » Bound Graph Polysemy |
164
Voted
SODA
1997
ACM
15 years 7 months ago
1997
ACM
We give a polynomial-time algorithm for the following problem: Given a degree sequence in which each degree is bounded from above by a constant, select, uniformly at random, an un...
157
click to vote
AUTOMATICA
2010
15 years 6 months ago
2010
We propose a class of discrete-time dynamic average consensus algorithms that allow a group of agents to track the average of their reference inputs. The convergence results rely ...
144
click to vote
DM
2010
15 years 6 months ago
2010
We introduce the concept of an edge-colouring total k-labelling. This is a labelling of the vertices and the edges of a graph G with labels 1, 2, . . . , k such that the weights o...
159
click to vote
DM
2007
15 years 6 months ago
2007
We study properties of the sets of minimal forbidden minors for the families of graphs having a vertex cover of size at most k. We denote this set by O(k-VERTEX COVER) and call it...
142
click to vote
IJBC
2002
15 years 5 months ago
2002
We give a method for finding symbolic dynamics for a planar diffeomorphism with a homoclinic tangle. The method only requires a finite piece of tangle, which can be computed with ...