5100 search results - page 93 / 1020 » The Linear Complexity of a Graph |
CORR
2009
Springer
13 years 7 months ago
2009
Springer
CORR
2010
Springer
13 years 6 months ago
2010
Springer
CORR
2010
Springer
13 years 5 months ago
2010
Springer
FCT
2011
Springer
12 years 9 months ago
2011
Springer
ISAAC
2005
Springer
14 years 2 months ago
2005
Springer
In this paper, we deal with both the complexity and the approximability of the labeled perfect matching problem in bipartite graphs. Given a simple graph G = (V, E) with n vertices...