779 search results - page 22 / 156 » A graph polynomial for independent sets of bipartite graphs |
ESA
2009
Springer
15 years 4 months ago
2009
Springer
Abstract. We show that the k-Dominating Set problem is fixed parameter tractable (FPT) and has a polynomial kernel for any class of
103
click to vote
SDM
2008
SIAM
14 years 11 months ago
2008
SIAM
Given an author-conference network that evolves over time, which are the conferences that a given author is most closely related with, and how do they change over time? Large time...
SSS
2010
Springer
14 years 8 months ago
2010
Springer
In this paper we present new distributed protocols to color even rings and general bipartite graphs. Our motivation is to provide algorithmic explanation for human subject experime...
ALENEX
2009
14 years 10 months ago
2009
In this paper we present an experimental study of several maximum flow algorithms in the context of unbalanced bipartite networks. Our experiments are motivated by a real world pr...
KDD
2009
ACM
15 years 10 months ago
2009
ACM
Recently many data types arising from data mining and Web search applications can be modeled as bipartite graphs. Examples include queries and URLs in query logs, and authors and ...