6598 search results - page 382 / 1320 » Graph Theory with Applications |
192
click to vote
ICPR
2008
IEEE
16 years 1 months ago
2008
IEEE
Graph cut algorithms (i.e., min s-t cuts) [3][10][15] are useful in many computer vision applications. In this paper we develop a formulation that allows the addition of side cons...
165
click to vote
ESA
2007
Springer
16 years 28 days ago
2007
Springer
Given a (directed or undirected) graph with edge costs, the power of a node is the maximum cost of an edge leaving it, and the power of the graph is the sum of the powers of its n...
181
click to vote
AAIM
2005
Springer
16 years 9 days ago
2005
Springer
Let G be a undirected connected graph. Given a set of g groups each being a subset of V (G), tree routing and coloring is to produce g trees in G and assign a color to each of them...
169
click to vote
DIGRA
2005
Springer
16 years 8 days ago
2005
Springer
This paper explores the idea that future game consoles and computers may no longer be single processor units, but instead symmetrical multiprocessor units. If this were to occur g...
196
click to vote
ADBIS
2004
Springer
16 years 4 days ago
2004
Springer
The old idea of navigation in a database is revisited with two essential changes: we address Web users rather than programmers and the navigation is accomplished as a visual metaph...