3267 search results - page 27 / 654 » Generalized quasirandom graphs |
133
click to vote
IEICET
2011
14 years 7 months ago
2011
In this paper, we study the minimum spanning tree problem for vertex-labeled graphs, where the weights of edges may vary depending on the selection of labels of vertices at both e...
119
Voted
AAAI
2012
13 years 3 months ago
2012
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...
120
click to vote
KDD
2008
ACM
16 years 1 months ago
2008
ACM
This work introduces a new family of link-based dissimilarity measures between nodes of a weighted directed graph. This measure, called the randomized shortest-path (RSP) dissimil...
103
click to vote
SIAMDM
2000
15 years 14 days ago
2000
We present a mathematical model for network routing based on generating paths in a consistent direction. Our development is based on an algebraic and geometric framework for defini...
127
Voted
WAOA
2010
Springer
14 years 10 months ago
2010
Springer
We study approximation solutions for the densest k-subgraph problem (DS-k) on several classes of intersection graphs. We adopt the concept of -quasi elimination orders, introduced ...