836 search results - page 48 / 168 » Orthogonal Colorings of Graphs |
131
Voted
CSL
2008
Springer
15 years 3 months ago
2008
Springer
Abstract. The notion of graph polynomials definable in Monadic Second Order Logic, MSOL, was introduced in [Mak04]. It was shown that the Tutte polynomial and its generalization, a...
111
click to vote
SSS
2010
Springer
15 years 8 days ago
2010
Springer
In this paper we present new distributed protocols to color even rings and general bipartite graphs. Our motivation is to provide algorithmic explanation for human subject experime...
116
click to vote
JCO
2007
15 years 1 months ago
2007
We consider the problem of orienting the edges of a graph so that the length of a longest path in the resulting digraph is minimum. As shown by Gallai, Roy and Vitaver, this edge ...
104
Voted
CVPR
1998
IEEE
16 years 3 months ago
1998
IEEE
An algorithm for tracking a person's head is presented. The head's projection onto the image plane is modeled as an ellipse whose position and size are continually updat...
EOR
2010
15 years 1 months ago
2010
Given an undirected graph G = (V, E) with a set V of vertices and a set E of edges, the graph coloring problem consists of partitioning all vertices into k independent sets and th...