183 search results - page 5 / 37 » On the Matching Problem for Special Graph Classes |
DAM
2006
14 years 9 months ago
2006
Motivated by issues in machine learning and statistical pattern classification, we investigate a class cover problem (CCP) with an associated family of directed graphs--class cove...
70
Voted
FSTTCS
2005
Springer
15 years 3 months ago
2005
Springer
We investigate the s-t-connectivity problem for directed planar graphs, which is hard for L and is contained in NL but is not known to be complete. We show that this problem is log...
85
Voted
EJC
2010
14 years 9 months ago
2010
A conjecture of G. Fan and A. Raspaud asserts that every bridgeless cubic graph contains three perfect matchings with empty intersection. We suggest a possible approach to problem...
NETWORKS
2011
14 years 4 months ago
2011
Abstract. We consider a basic subproblem which arises in line planning, and is of particular importance in the context of a high system load or robustness: How much can be routed m...
GBRPR
2005
Springer
15 years 3 months ago
2005
Springer
Abstract. Graph matching is often used for image recognition. Different kinds of graph matchings have been proposed such as (sub)graph isomorphism or error-tolerant graph matching...