Sciweavers

Share
COCOON
2006
Springer
9 years 3 months ago
Finding Small OBDDs for Incompletely Specified Truth Tables Is Hard
We present an efficient reduction mapping undirected graphs G with n = 2k vertices for integers k to tables of partially specified Boolean functions g : {0, 1}4k+1 {0, 1, } so tha...
Jesper Torp Kristensen, Peter Bro Miltersen
GD
1994
Springer
9 years 3 months ago
A Fast Adaptive Layout Algorithm for Undirected Graphs
d Abstract and System Demonstration) Arne Frick , Andreas Ludwig, Heiko Mehldau Universit
Arne Frick, Andreas Ludwig, Heiko Mehldau
APPROX
2000
Springer
190views Algorithms» more  APPROX 2000»
9 years 3 months ago
Approximating node connectivity problems via set covers
Given a graph (directed or undirected) with costs on the edges, and an integer k, we consider the problem of nding a k-node connected spanning subgraph of minimum cost. For the ge...
Guy Kortsarz, Zeev Nutov
WAOA
2005
Springer
170views Algorithms» more  WAOA 2005»
9 years 4 months ago
On Approximating Restricted Cycle Covers
A cycle cover of a graph is a set of cycles such that every vertex is part of exactly one cycle. An L-cycle cover is a cycle cover in which the length of every cycle is in the set...
Bodo Manthey
STACS
2005
Springer
9 years 4 months ago
A Polynomial Time Algorithm for Minimum Cycle Basis in Directed Graphs
Abstract. We consider the problem of computing a minimum cycle basis in a directed graph G with m arcs and n vertices. The arcs of G have non-negative weights assigned to them. We ...
Telikepalli Kavitha, Kurt Mehlhorn
MFCS
2005
Springer
9 years 4 months ago
D-Width: A More Natural Measure for Directed Tree Width
Due to extensive research on tree-width for undirected graphs and due to its many applications in various fields it has been a natural desire for many years to generalize the idea...
Mohammad Ali Safari
ESA
2005
Springer
98views Algorithms» more  ESA 2005»
9 years 4 months ago
Small Stretch Spanners on Dynamic Graphs
We present fully dynamic algorithms for maintaining 3- and 5-spanners of undirected graphs under a sequence of update operations. For unweighted graphs we maintain a 3or 5-spanner...
Giorgio Ausiello, Paolo Giulio Franciosa, Giuseppe...
ICANN
2007
Springer
9 years 5 months ago
Recursive Principal Component Analysis of Graphs
Treatment of general structured information by neural networks is an emerging research topic. Here we show how representations for graphs preserving all the information can be devi...
Alessio Micheli, Alessandro Sperduti
FUZZIEEE
2007
IEEE
9 years 5 months ago
Learning Undirected Possibilistic Networks with Conditional Independence Tests
—Approaches based on conditional independence tests are among the most popular methods for learning graphical models from data. Due to the predominance of Bayesian networks in th...
Christian Borgelt
FCT
2009
Springer
9 years 5 months ago
Directed Graphs of Entanglement Two
Entanglement is a complexity measure for directed graphs that was used to show that the variable hierarchy of the propositional modal µ-calculus is strict. While graphs of entangl...
Erich Grädel, Lukasz Kaiser, Roman Rabinovich
books