779 search results - page 44 / 156 » A graph polynomial for independent sets of bipartite graphs |
SIAMDM
2000
14 years 9 months ago
2000
Abstract. We describe fully polynomial time approximation schemes for various multicommodity flow problems in graphs with m edges and n vertices. We present the first approximation...
WG
2005
Springer
15 years 3 months ago
2005
Springer
Broadcast domination was introduced by Erwin in 2002, and it is a variant of the standard dominating set problem, such that vertices can be assigned various domination powers. Broa...
107
click to vote
OL
2010
14 years 4 months ago
2010
This article studies a degree-bounded generalization of independent sets called co-k-plexes. Constant factor approximation algorithms are developed for the maximum co-k-plex probl...
MFCS
2004
Springer
15 years 3 months ago
2004
Springer
We study the on-line versions of two fundamental graph problems, maximum independent set and minimum coloring, for the case of disk graphs which are graphs resulting from intersect...
JMLR
2006
14 years 9 months ago
2006
We discuss the problem of learning to rank labels from a real valued feedback associated with each label. We cast the feedback as a preferences graph where the nodes of the graph ...