1162 search results - page 31 / 233 » Minimum Cycle Bases in Graphs Algorithms and Applications |
131
Voted
ASPDAC
2001
ACM
15 years 7 months ago
2001
ACM
Given n points in a plane, a minimum spanning tree is a set of edges which connects all the points and has a minimum total length. A naive approach enumerates edges on all pairs o...
132
Voted
ROBOCUP
2005
Springer
15 years 9 months ago
2005
Springer
Abstract. Coordination graphs offer a tractable framework for cooperative multiagent decision making by decomposing the global payoff function into a sum of local terms. Each age...
125
Voted
IPPS
2007
IEEE
15 years 10 months ago
2007
IEEE
Graphs capture the essential elements of many problems broadly defined as searching or categorizing. With the rapid increase of data volumes from sensors, many application discipl...
137
Voted
AAAI
2008
15 years 6 months ago
2008
We consider a multiagent extension of single-agent graph coloring. Multiple agents hold disjoint autonomous subgraphs of a global graph, and every color used by the agents in colo...
145
Voted
MP
1998
15 years 3 months ago
1998
Consider a directed graph G = (V;A), and a set of tra c demands to be shipped between pairs of nodes in V. Capacity has to be installed on the edges of this graph (in integer mult...