74 search results - page 7 / 15 » On edge orienting methods for graph coloring |
ICPR
2008
IEEE
14 years 1 months ago
2008
IEEE
Finding correspondences of two images taken from largely different camera configuration is a challenging problem because appearance information such as color, intensity and edge o...
DAM
2011
13 years 2 months ago
2011
An arc of a graph is an oriented edge and a 3-arc is a 4-tuple (v, u, x, y) of vertices such that both (v, u, x) and (u, x, y) are paths of length two. The 3-arc graph of a graph ...
ICPR
2004
IEEE
14 years 8 months ago
2004
IEEE
A new method of structural graph matching is introduced and compared against an existing method and against the maximum common subgraph. The method is approximate with polynomial ...
WG
2010
Springer
13 years 5 months ago
2010
Springer
We present a linear time algorithm to greedily orient the edges of a path graph model to obtain a directed path graph model (when possible). Moreover we extend this algorithm to fi...
SAT
2009
Springer
14 years 1 months ago
2009
Springer
Abstract. We present a new method to break symmetry in graph coloring problems. While most alternative techniques add symmetry breaking predicates in a pre-processing step, we deve...