Solving a problem using cooperating data structures
Abstract
In this write-up, we describe series parallel graphs, a simple class of general graphs, and show how to compute their minimum spanning tree or shortest path. The problem is intended to be used as an assignment in an undergraduate course on Data Structures. It is a simple problem, yet non-trivial, and allows the students to implement several interesting data structures in one programming assignment.
References
[1]
J. Valdes, Parsingflowcharts and series-parallel graphs, Technical Report STAN-CS-78-682, Computer Science Department, Stanford University, Stanford, California, 1978.
[2]
J. Valdes, R.E. Taxjan, and E. Lawler, The Recognition of Series Parallel Digraphs, SIAM Journal on Computing, Vol. 11 No. 2, 1982, 298-313.
Index Terms
- Solving a problem using cooperating data structures
Recommendations
Solving a problem using cooperating data structures
In this write-up, we describe series parallel graphs, a simple class of general graphs, and show how to compute their minimum spanning tree or shortest path. The problem is intended to be used as an assignment in an undergraduate course on Data ...
Solving the path cover problem on circular-arc graphs by using an approximation algorithm
A path cover of a graph G=(V,E) is a family of vertex-disjoint paths that covers all vertices in V. Given a graph G, the path cover problem is to find a path cover of minimum cardinality. This paper presents a simple O(n)-time approximation algorithm ...
Comments
Information & Contributors
Information
Published In
March 1995
436 pages
ISBN:089791693X
DOI:10.1145/199688
- Chairman:
- Cary Laxer,
- Editors:
- Curt M. White,
- James E. Miller,
- Judy Gersting
Copyright © 1995 ACM.
Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]
Sponsors
Publisher
Association for Computing Machinery
New York, NY, United States
Publication History
Published: 15 March 1995
Check for updates
Qualifiers
- Article
Conference
SIGCSE95
Sponsor:
SIGCSE95: 26th SIGCSE Technical Symposium on Computer Science Education
March 2 - 4, 1995
Tennessee, Nashville, USA
Acceptance Rates
Overall Acceptance Rate 1,595 of 4,542 submissions, 35%
Upcoming Conference
SIGCSE Virtual 2024
- Sponsor:
- sigcse
Contributors
Other Metrics
Bibliometrics & Citations
Bibliometrics
Article Metrics
- 0Total Citations
- 260Total Downloads
- Downloads (Last 12 months)32
- Downloads (Last 6 weeks)7
Reflects downloads up to 14 Oct 2024
Other Metrics
Citations
View Options
Get Access
Login options
Check if you have access through your login credentials or your institution to get full access on this article.
Sign in