2487 search results - page 291 / 498 » Partitions of Graphs into Trees |
119
Voted
SIGECOM
2003
ACM
15 years 8 months ago
2003
ACM
We study mechanisms that can be modelled as coalitional games with transferable utilities, and apply ideas from mechanism design and game theory to problems arising in a network d...
121
Voted
COCOON
2009
Springer
15 years 10 months ago
2009
Springer
In [3], the authors introduced the Generalised Character Compatibility Problem as a generalisation of the Perfect Phylogeny Problem for a set of species. This generalised problem t...
165
Voted
SAC
2003
ACM
15 years 8 months ago
2003
ACM
Given a connected, weighted, undirected graph G and a bound D, the bounded-diameter minimum spanning tree problem seeks a spanning tree on G of lowest weight in which no path betw...
152
Voted
AAMAS
2012
Springer
13 years 11 months ago
2012
Springer
In multiagent settings where agents have different preferences, preference aggregation can be an important issue. Voting is a general method to aggregate preferences. We consider ...
115
Voted
GECCO
2003
Springer
15 years 8 months ago
2003
Springer
Abstract. In this paper, we propose a hybrid genetic algorithm for partitioning a VLSI circuit graph into two disjoint graphs of minimum cut size. The algorithm includes a local op...