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" [...]


  There are three major facts that should be watched out for in all payday loans in the United States. On the global pharmaceutical market this medicine was issued in 2003 by two companies - Eli Lilly and ICOS. Initially, permission to sell Cialis was obtained in Europe, Australia, New Zealand.