803 search results - page 66 / 161 » Independence in Direct-Product Graphs |
92
Voted
TCS
2008
15 years 19 days 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...
ICPR
2008
IEEE
16 years 1 months ago
2008
IEEE
This paper addresses the problem of learning archetypal structural models from examples. To this end we define a generative model for graphs where the distribution of observed nod...
DAC
1998
ACM
16 years 1 months ago
1998
ACM
We have developed a new algorithm and software for graph coloring by systematically combining several algorithm and software development ideas that had crucial impact on the algor...
116
click to vote
TPHOL
2008
IEEE
15 years 7 months ago
2008
IEEE
Slicing is a widely-used technique with applications in e.g. compiler technology and software security. Thus verification of algorithms in these areas is often based on the correc...
90
Voted
ECCV
2010
Springer
15 years 5 months ago
2010
Springer
Many segmentation algorithms describe images in terms of a hierarchy of regions. Although such hierarchies can produce state of the art segmentations and have many applications, th...