2283 search results - page 98 / 457 » Bounds of Graph Characteristics |
IROS
2006
IEEE
14 years 2 months ago
2006
IEEE
— This paper discusses the first implementation of a dynamically stable bounding gait on a hybrid wheeled-leg robot. Design of the robot is reviewed and the controllers which al...
STOC
2007
ACM
14 years 8 months ago
2007
ACM
In the MINIMUM BOUNDED DEGREE SPANNING TREE problem, we are given an undirected graph with a degree upper bound Bv on each vertex v, and the task is to find a spanning tree of min...
ADT
2005
13 years 8 months ago
2005
For coded transmission over a memoryless channel, two kinds of mutual information are considered: the mutual information between a code symbol and its noisy observation and the ove...
WAOA
2004
Springer
14 years 1 months ago
2004
Springer
Abstract. A strong vertex coloring of a hypergraph assigns distinct colors to vertices that are contained in a common hyperedge. This captures many previously studied graph colorin...
SIROCCO
1997
13 years 9 months ago
1997
We show the existence of various versions of expander graphs using Kolmogorov complexity. This method seems superior to the usual “probabilistic construction”. Also, the best k...