779 search results - page 19 / 156 » A graph polynomial for independent sets of bipartite graphs |
ICPR
2004
IEEE
15 years 10 months ago
2004
IEEE
Given two or more images, we can define different but related problems on pattern matching such as image registration, pattern detection and localization, and common pattern disco...
ARSCOM
2007
14 years 9 months ago
2007
We partition the set of spanning trees contained in the complete graph Kn into spanning trees contained in the complete bipartite graph Ks,t. This relation will show that any prop...
DM
2002
14 years 9 months ago
2002
A dual-eulerian graph is a plane graph which has an ordering defined on its edge set which forms simultaneously an Euler circuit in the graph and an euler circuit in the dual grap...
MOR
2010
14 years 8 months ago
2010
We consider the mixed integer version of bipartite vertex cover. This is equivalent to the mixed integer network dual model, recently introduced in [2], that generalizes several m...
CORR
2006
Springer
14 years 9 months ago
2006
Springer
Once the set of finite graphs is equipped with an algebra structure (arising from the definition of operations that generalize the concatenation of words), one can define the noti...