Ebook Info
- Published: 1994
- Number of pages: 448 pages
- Format: PDF
- File Size: 18.91 MB
- Authors: Jan van Leeuwen
Description
This volume contains the proceedings of the 19th International Workshop on Graph-Theoretic Concepts in Computer Science, WG ’93, held near Utrecht, The Netherlands, in 1993. The papers are grouped into parts on: hard problems on classes of graphs, structural graph theory, dynamic graph algorithms, structure-oriented graph algorithms, graph coloring, AT-free and chordal graphs, circuits and nets, graphs and interconnection networks, routing and shortest paths, and graph embedding and layout. The 35 revised papers were chosen from 92 submissions after a careful refereeing process.
User’s Reviews
Keywords
Free Download Graph-Theoretic Concepts in Computer Science: 19th International Workshop, WG ’93, Utrecht, The Netherlands, June 16 – 18, 1993. Proceedings (Lecture Notes in Computer Science, 790) 1994th Edition in PDF format
Graph-Theoretic Concepts in Computer Science: 19th International Workshop, WG ’93, Utrecht, The Netherlands, June 16 – 18, 1993. Proceedings (Lecture Notes in Computer Science, 790) 1994th Edition PDF Free Download
Download Graph-Theoretic Concepts in Computer Science: 19th International Workshop, WG ’93, Utrecht, The Netherlands, June 16 – 18, 1993. Proceedings (Lecture Notes in Computer Science, 790) 1994th Edition 1994 PDF Free
Graph-Theoretic Concepts in Computer Science: 19th International Workshop, WG ’93, Utrecht, The Netherlands, June 16 – 18, 1993. Proceedings (Lecture Notes in Computer Science, 790) 1994th Edition 1994 PDF Free Download
Download Graph-Theoretic Concepts in Computer Science: 19th International Workshop, WG ’93, Utrecht, The Netherlands, June 16 – 18, 1993. Proceedings (Lecture Notes in Computer Science, 790) 1994th Edition PDF
Free Download Ebook Graph-Theoretic Concepts in Computer Science: 19th International Workshop, WG ’93, Utrecht, The Netherlands, June 16 – 18, 1993. Proceedings (Lecture Notes in Computer Science, 790) 1994th Edition
