9532 search results - page 38 / 1907 » Logic, Graphs, and Algorithms |
172
click to vote
WG
2010
Springer
15 years 4 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...
212
click to vote
DAC
2004
ACM
16 years 7 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...
156
click to vote
WG
2005
Springer
15 years 12 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.
187
click to vote
CSL
2006
Springer
15 years 10 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...