Sciweavers

9532 search results - page 4 / 1907
» Logic, Graphs, and Algorithms
Sort
View
ICALP
1995
Springer
14 years 1 months ago
Parallel Algorithms with Optimal Speedup for Bounded Treewidth
We describe the rst parallel algorithm with optimal speedup for constructing minimum-width tree decompositions of graphs of bounded treewidth. On n-vertex input graphs, the algori...
Hans L. Bodlaender, Torben Hagerup
EUROPAR
2007
Springer
14 years 4 months ago
Hirschberg's Algorithm on a GCA and Its Parallel Hardware Implementation
We present in detail a GCA (Global Cellular Automaton) algorithm with 3n cells for Hirschberg’s algorithm which determines the connected components of a n-node undirected graph w...
Johannes Jendrsczok, Rolf Hoffmann, Jörg Kell...
IJCAI
2003
13 years 11 months ago
Automated Verification: Graphs, Logic, and Automata
Automated verification is one of the most success­ ful applications of automated reasoning in com­ puter science. In automated verification one uses algorithmic techniques to es...
Moshe Y. Vardi
ESA
2010
Springer
172views Algorithms» more  ESA 2010»
13 years 11 months ago
Algorithmic Meta-theorems for Restrictions of Treewidth
Abstract. Possibly the most famous algorithmic meta-theorem is Courcelle's theorem, which states that all MSO-expressible graph properties are decidable in linear time for gra...
Michael Lampis
ICCAD
1999
IEEE
119views Hardware» more  ICCAD 1999»
14 years 2 months ago
Factoring logic functions using graph partitioning
Algorithmic logic synthesis is usually carried out in two stages, the independent stage where logic minimization is performed on the Boolean equations with no regard to physical p...
Martin Charles Golumbic, Aviad Mintz