Sciweavers

677 search results - page 24 / 136
» Bipartite roots of graphs
Sort
View
AAAI
2012
11 years 9 months ago
Computing the Nucleolus of Matching, Cover and Clique Games
In cooperative games, a key question is to find a division of payoffs to coalition members in a fair manner. Nucleolus is one of such solution concepts that provides a stable sol...
Ning Chen, Pinyan Lu, Hongyang Zhang
SIAMDM
2008
83views more  SIAMDM 2008»
13 years 7 months ago
Combinatorial Properties of a Rooted Graph Polynomial
For a rooted graph G, let EV (G; p) be the expected number of vertices reachable from the root when each edge has an independent probability p of operating successfully. We examine...
David Eisenstat, Gary Gordon, Amanda Redlich
DM
2000
99views more  DM 2000»
13 years 7 months ago
Chromatically unique bipartite graphs with low 3-independent partition numbers
For integers p; q; s with p
Feng Ming Dong, Khee Meng Koh, Kee L. Teo, Charles...
JCT
1998
122views more  JCT 1998»
13 years 7 months ago
Counting 1-Factors in Regular Bipartite Graphs
We show that any k-regular bipartite graph with 2n vertices has at least ((k−1)k−1 kk−2 )n perfect matchings (1-factors). Equivalently, this is a lower bound on the permanent...
Alexander Schrijver
WWW
2008
ACM
14 years 8 months ago
Web video topic discovery and tracking via bipartite graph reinforcement model
Automatic topic discovery and tracking on web-shared videos can greatly benefit both web service providers and end users. Most of current solutions of topic detection and tracking...
Lu Liu, Lifeng Sun, Yong Rui, Yao Shi, Shiqiang Ya...