dc.contributor.author | Lee, Boon Chai | en_US |
dc.contributor.other | Massachusetts Institute of Technology. Flight Transportation Laboratory | en_US |
dc.date.accessioned | 2012-01-06T22:25:06Z | |
dc.date.available | 2012-01-06T22:25:06Z | |
dc.date.issued | 1982 | en_US |
dc.identifier | 29178107 | en_US |
dc.identifier.uri | http://hdl.handle.net/1721.1/68106 | |
dc.description | June 1982 | en_US |
dc.description | Also issued as an M.S. thesis, Dept. of Aeronautics and Astronautics, 1982 | en_US |
dc.description | Includes bibliographical references (p. 129-132) | en_US |
dc.description.abstract | A review of methods of enumerating elementary cycles and circuits is presented. For the directed planar graph, a geometric view of circuit generation is introduced making use of the properties of dual graphs. Given the set of elementary cycles or circuits, a particular algorithm is recommended to generate all simple circuits. A simple example accompanies each of the methods discussed. Some methods of reducing the size of the graph but maintaining all circuits are introduced. Worst-case bounds on computational time and space are also given. The problem of enumerating elementary circuits whose cost is less than a certain fixed cost is solved by modifying an existing algorithm. The cost of a circuit is the sum of the cost of the arcs forming the circuit where arc costs are not restricted to be positive. Applications of circuits with particular properties are suggested. | en_US |
dc.format.extent | 132 p | en_US |
dc.publisher | Cambridge, Mass. : Massachusetts Institute of Technology, Dept. of Aeronautics & Astronautics, Flight Transportation Laboratory, [1982] | en_US |
dc.relation.ispartofseries | FTL report (Massachusetts Institute of Technology. Flight Transportation Laboratory) ; R82-7 | en_US |
dc.subject | Graph theory | en_US |
dc.subject | Algorithms | en_US |
dc.subject | Data processing | en_US |
dc.title | Algorithmic approaches to circuit enumeration problems and applications | en_US |
dc.type | Technical Report | en_US |