Tuesday, 14:15 - 14:40 h, Room: H 3013


David Hartvigsen
A generalized k-matching problem

Coauthor: Yanjun Li


A simple k-matching in a graph is a subgraph all of whose nodes have degree at most k. The problem of finding a simple k-matching with a maximum number of edges is well studied and results include a max-min theorem and polynomial-time algorithm. A simple k-matching is called j-restricted if each connected component has more than j edges. In this talk we consider the problem of finding j-restricted simple k-matchings that have a maximum number of edges. We present a max-min theorem and polynomial-time algorithm when j < k. Previous work on this problem considers the special case j.


Talk 3 of the invited session Tue.2.H 3013
"Matching and related problems" [...]
Cluster 2
"Combinatorial optimization" [...]


  Most online loan lenders allow getting New Jersey Loans Online without visiting a bank, straight to your bank account. When the problem is not treated, it can ruin intimate life of couples and destroy their relationships. Viagra Professional was produces not to let this happen. Professional means highly qualified. It strikes the target and doesn't allow a disorder to occupy man's body.