138 search results - page 26 / 28 » Bisimplicial Edges in Bipartite Graphs |
ISCAS
1999
IEEE
13 years 11 months ago
1999
IEEE
The bigraph crossing problem, embedding the two node sets of a bipartite graph G = V0;V1;E along two parallel lines so that edge crossings are minimized, has application to placeme...
WWW
2005
ACM
14 years 8 months ago
2005
ACM
We offer the first large-scale analysis of Web traffic based on network flow data. Using data collected on the Internet2 network, we constructed a weighted bipartite clientserver ...
ESA
2004
Springer
14 years 25 days ago
2004
Springer
Edge contraction is shown to be a useful mechanism to improve lower bound heuristics for treewidth. A successful lower bound for treewidth is the degeneracy: the maximum over all ...
ECAI
2008
Springer
13 years 9 months ago
2008
Springer
We extend the resistance distance kernel to the domain of signed dissimilarity values, and show how it can be applied to collaborative rating prediction. The resistance distance is...
RECSYS
2010
ACM
13 years 7 months ago
2010
ACM
An increasing number of social networking platforms are giving users the option to endorse entities that they find appealing, such as videos, photos, or even other users. We defin...