836 search results - page 45 / 168 » Orthogonal Colorings of Graphs |
100
click to vote
TCS
2008
15 years 1 months ago
2008
Given a graph G and an integer k, two players alternatively color the edges of G using k colors so that adjacent edges get different colors. The game chromatic index g(G) is the m...
139
Voted
RSA
2008
15 years 1 months ago
2008
: Given a graph G and an integer k, two players take turns coloring the vertices of G one by one using k colors so that neighboring vertices get different colors. The first player ...
CLEAR
2006
Springer
15 years 5 months ago
2006
Springer
We present an object detection and tracking algorithm that addresses the problem of multiple simultaneous targets tracking in realworld surveillance scenarios. The algorithm is bas...
111
Voted
COMBINATORICA
2008
15 years 2 months ago
2008
A parity walk in an edge-coloring of a graph is a walk along which each color is used an even number of times. Let p(G) be the least number of colors in an edge-coloring of G havi...
122
click to vote
ORDER
2008
15 years 1 months ago
2008
Orthogonal surfaces are nice mathematical objects which have interesting connections to various fields, e.g., integer programming, monomial ideals and order dimension. While orthog...