Sciweavers

3396 search results - page 37 / 680
» Tree representations of graphs
Sort
View
ESA
2008
Springer
101views Algorithms» more  ESA 2008»
13 years 10 months ago
Faster Steiner Tree Computation in Polynomial-Space
Given an n-node graph and a subset of k terminal nodes, the NP-hard Steiner tree problem is to compute a minimum-size tree which spans the terminals. All the known algorithms for t...
Fedor V. Fomin, Fabrizio Grandoni, Dieter Kratsch
JGAA
2007
123views more  JGAA 2007»
13 years 8 months ago
A Polynomial Time Algorithm for Finding Nash Equilibria in Planar Win-Lose Games
Abstract. Two-player win-lose games have a simple directed graph representation. Exploiting this, we develop graph theoretic techniques for finding Nash equilibria in such games. ...
Louigi Addario-Berry, Neil Olver, Adrian Vetta
BIRTHDAY
2010
Springer
14 years 3 months ago
Extended Compact Web Graph Representations
Abstract. Many relevant Web mining tasks translate into classical algorithms on the Web graph. Compact Web graph representations allow running these tasks on larger graphs within m...
Francisco Claude, Gonzalo Navarro
FUIN
2007
108views more  FUIN 2007»
13 years 8 months ago
Local Properties of Triangular Graphs
In the paper triangular graphs are discussed. The class of triangular graphs is of special interest as unifying basic features of complete graphs with trees and being used on many ...
Antoni W. Mazurkiewicz
SIPS
2006
IEEE
14 years 2 months ago
Configuration and Representation of Large-Scale Dataflow Graphs using the Dataflow Interchange Format
—A wide variety of DSP design tools have been developed that incorporate dataflow graph representations into their GUI-based design environments. However, as the complexity of ap...
Ivan Corretjer, Chia-Jui Hsu, Shuvra S. Bhattachar...