Sciweavers

1420 search results - page 10 / 284
» Representation of Graphs by OBDDs
Sort
View
SEMWEB
2010
Springer
13 years 8 months ago
Compact Representation of Large RDF Data Sets for Publishing and Exchange
Abstract. Increasingly huge RDF data sets are being published on the Web. Currently, they use different syntaxes of RDF, contain high levels of redundancy and have a plain indivisi...
Javier D. Fernández, Miguel A. Martí...
JGAA
2007
123views more  JGAA 2007»
13 years 10 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 5 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
SIPS
2006
IEEE
14 years 4 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...
SODA
2012
ACM
243views Algorithms» more  SODA 2012»
12 years 1 months ago
Bidimensionality and geometric graphs
Bidimensionality theory was introduced by Demaine et al. [JACM 2005 ] as a framework to obtain algorithmic results for hard problems on minor closed graph classes. The theory has ...
Fedor V. Fomin, Daniel Lokshtanov, Saket Saurabh