skip to content
Short encodings of evolving structures Preview this item
ClosePreview this item
Checking...

Short encodings of evolving structures

Author: Daniel D Sleator; Robert E Tarjan; William P Thurston
Publisher: Pittsburgh, Pa. : School of Computer Science, Carnegie Mellon University, [1991]
Series: Research paper (Carnegie Mellon University. School of Computer Science), CMU-CS-91-206.
Edition/Format:   Book : EnglishView all editions and formats
Database:WorldCat
Summary:
Abstract: "A derivation in a transformational system such as a graph grammar may be redundant in the sense that the exact order of the transformations may not affect the final outcome; all that matters is that each transformation, when applied, is applied to the correct substructure. By taking advantage of this redundancy, we are able to develop an efficient encoding scheme for such derivations. This encoding scheme
Rating:

(not yet rated) 0 with reviews - Be the first.

Subjects
More like this

 

Find a copy in the library

&AllPage.SpinnerRetrieving; Finding libraries that hold this item...

Details

Document Type: Book
All Authors / Contributors: Daniel D Sleator; Robert E Tarjan; William P Thurston
OCLC Number: 25683200
Notes: "December 1991."
Description: 26 p. : ill. ; 28 cm.
Series Title: Research paper (Carnegie Mellon University. School of Computer Science), CMU-CS-91-206.
Responsibility: Daniel D.K. Sleator, Robert E. Tarjan, William P. Thurston.

Abstract:

Abstract: "A derivation in a transformational system such as a graph grammar may be redundant in the sense that the exact order of the transformations may not affect the final outcome; all that matters is that each transformation, when applied, is applied to the correct substructure. By taking advantage of this redundancy, we are able to develop an efficient encoding scheme for such derivations. This encoding scheme has a number of diverse applications. It can be used in efficient enumeration of combinatorial objects or for compact representation of program and data structure transformations. It can also be used to derive lower bounds on lengths of derivations.

We show for example that [omega](n log n) applications of the associative and commutative laws are required in the worst case to transform an n-variable expression over a binary associative, commutative operation into some other equivalent expression. Similarly, we show that [omega](n log n) 'diagonal flips' are required in the worst case to transform one n-vertex numbered triangulated planar graph into some other one. Both of these lower bounds have matching upper bounds. An O(n log n) upper bound for associative, commutative operations was known previously, whereas we obtain here an O(n log n) upper bound for diagonal flips."

Reviews

User-contributed reviews
Retrieving GoodReads reviews...
Retrieving DOGObooks reviews...

Tags

Be the first.

Similar Items

Related Subjects:(1)

Confirm this request

You may have already requested this item. Please select Ok if you would like to proceed with this request anyway.

Linked Data


<http://www.worldcat.org/oclc/25683200>
library:oclcnum"25683200"
library:placeOfPublication
library:placeOfPublication
owl:sameAs<info:oclcnum/25683200>
rdf:typeschema:Book
schema:about
schema:about
schema:contributor
schema:contributor
schema:creator
schema:datePublished"1991"
schema:description"We show for example that [omega](n log n) applications of the associative and commutative laws are required in the worst case to transform an n-variable expression over a binary associative, commutative operation into some other equivalent expression. Similarly, we show that [omega](n log n) 'diagonal flips' are required in the worst case to transform one n-vertex numbered triangulated planar graph into some other one. Both of these lower bounds have matching upper bounds. An O(n log n) upper bound for associative, commutative operations was known previously, whereas we obtain here an O(n log n) upper bound for diagonal flips.""@en
schema:description"Abstract: "A derivation in a transformational system such as a graph grammar may be redundant in the sense that the exact order of the transformations may not affect the final outcome; all that matters is that each transformation, when applied, is applied to the correct substructure. By taking advantage of this redundancy, we are able to develop an efficient encoding scheme for such derivations. This encoding scheme has a number of diverse applications. It can be used in efficient enumeration of combinatorial objects or for compact representation of program and data structure transformations. It can also be used to derive lower bounds on lengths of derivations."@en
schema:exampleOfWork<http://worldcat.org/entity/work/id/26003906>
schema:inLanguage"en"
schema:name"Short encodings of evolving structures"@en
schema:numberOfPages"26"
schema:publisher
schema:url

Content-negotiable representations

Close Window

Please sign in to WorldCat 

Don't have an account? You can easily create a free account.