Sciweavers

Share
NC
2011
236views Neural Networks» more  NC 2011»
9 years 2 months ago
Graph multiset transformation: a new framework for massively parallel computation inspired by DNA computing
In this paper, graph multiset transformation is introduced and studied as a novel type of parallel graph transformation. The basic idea is that graph transformation rules may be ap...
Hans-Jörg Kreowski, Sabine Kuske
PPL
2007
126views more  PPL 2007»
9 years 11 months ago
Challenges in Parallel Graph Processing
Graph algorithms are becoming increasingly important for solving many problems in scientific computing, data mining and other domains. As these problems grow in scale, parallel c...
Andrew Lumsdaine, Douglas Gregor, Bruce Hendrickso...
TIT
1998
79views more  TIT 1998»
9 years 11 months ago
Greedy and Heuristic Algorithms for Codes and Colorings
Abstract— Many of the fundamental coding problems can be represented as graph problems. These problems are often intrinsically difficult and unsolved even if the code length is ...
Tuvi Etzion, Patric R. J. Östergård
BMCBI
2008
115views more  BMCBI 2008»
9 years 11 months ago
BioGraphE: high-performance bionetwork analysis using the Biological Graph Environment
Background: Graphs and networks are common analysis representations for biological systems. Many traditional graph algorithms such as k-clique, k-coloring, and subgraph matching h...
George Chin Jr., Daniel G. Chavarría-Mirand...
ESA
2010
Springer
170views Algorithms» more  ESA 2010»
10 years 20 days ago
Streaming Graph Computations with a Helpful Advisor
Motivated by the trend to outsource work to commercial cloud computing services, we consider a variation of the streaming paradigm where a streaming algorithm can be assisted by a...
Graham Cormode, Michael Mitzenmacher, Justin Thale...
CIE
2007
Springer
10 years 5 months ago
The Complexity Ecology of Parameters: An Illustration Using Bounded Max Leaf Number
In the framework of parameterized complexity, exploring how one parameter affects the complexity of a different parameterized (or unparameterized problem) is of general interest....
Michael R. Fellows, Frances A. Rosamond
TAMC
2009
Springer
10 years 6 months ago
Best-Order Streaming Model
We study a new model of computation called stream checking on graph problems where a space-limited verifier has to verify a proof sequentially (i.e., it reads the proof as a strea...
Atish Das Sarma, Richard J. Lipton, Danupon Nanong...
IWPEC
2009
Springer
10 years 6 months ago
Boolean-Width of Graphs
Abstract. We introduce the graph parameter boolean-width, related to the number of different unions of neighborhoods across a cut of a graph. For many graph problems this number is...
Binh-Minh Bui-Xuan, Jan Arne Telle, Martin Vatshel...
books