9532 search results - page 38 / 1907 » Logic, Graphs, and Algorithms |
WG
2010
Springer
13 years 9 months ago
2010
Springer
The problem of determining the cutwidth of a graph is a notoriously hard problem which remains NP-complete under severe restrictions on input graphs. Until recently, non-trivial p...
WILF
2007
Springer
14 years 5 months ago
2007
Springer
DAC
2004
ACM
14 years 12 months ago
2004
ACM
Reversible logic has applications in many fields, including quantum computing. Synthesis techniques for reversible circuits are not well developed, even for functions with a small...
WG
2005
Springer
14 years 4 months ago
2005
Springer
We improve the current complexities for maintaining a chordal graph by starting with an empty graph and repeatedly adding or deleting edges.
CSL
2006
Springer
14 years 2 months ago
2006
Springer
Rational graphs are a family of graphs defined using labelled rational transducers. Unlike automatic graphs (defined using synchronized transducers) the first order theory of these...