Combinatorial generation by fusing loopless algorithms
| dc.contributor.author | Takaoka, T. | |
| dc.contributor.author | Violich, S. | |
| dc.date.accessioned | 2007-06-26T04:26:23Z | |
| dc.date.available | 2007-06-26T04:26:23Z | |
| dc.date.issued | 2006 | en |
| dc.description.abstract | Some combinatorial generation problems can be bro- ken into subproblems for which loopless algorithms already exist. We discuss means by which loop- less algorithms can be fused to produce a new loop- less algorithm that solves the original problem. We demonstrate this method with two new loopless algo- rithms, MIXPAR and MULTPERM. MIXPAR gen- erates well-formed parenthesis strings containing two different types of parentheses. MULTPERM gener- ates multiset permutations in linear space using only arrays; it is simpler and more efficient than the recent algorithm of Korsh and LaFollette (2004). | en |
| dc.identifier.citation | Takaoka, T., Violich, S. (2006) Combinatorial Generation by fusing loopless algorithms. Hobart, Australia: Computing: The Australasian Theory Symposium (CATS 2006), 16-19 Jan 2006. Conferences in Research and Practice in Information Technology, 51, Twelfth Computing: The Australasian Theory Symposi, 69-77. | en |
| dc.identifier.isbn | 978-1-920682-33-0 | |
| dc.identifier.uri | http://hdl.handle.net/10092/115 | |
| dc.language.iso | en | |
| dc.publisher | University of Canterbury. Computer Science and Software Engineering. | en |
| dc.rights.uri | https://hdl.handle.net/10092/17651 | en |
| dc.subject.marsden | Fields of Research::280000 Information, Computing and Communication Sciences::280300 Computer Software | en |
| dc.subject.marsden | Fields of Research::280000 Information, Computing and Communication Sciences::280400 Computation Theory and Mathematics::280401 Analysis of algorithms and complexity | en |
| dc.title | Combinatorial generation by fusing loopless algorithms | en |
| dc.type | Conference Contributions - Published |
Files
Original bundle
1 - 1 of 1