Shortest Paths in Digraphs of Small Treewidth. Part I: Sequential Algorithms S. ChaudhuriC. D. Zaroliagis Pages: 212 - 226
A Linear Algorithm for Finding \boldmath[{g,f }]-Colorings of Partial \boldmath{k }-Trees X. ZhouK. FuseT. Nishizeki Pages: 227 - 243
Linear-Time Algorithms for Partial \boldmathk -Tree Complements A. GuptaD. KallerT. Shermer Pages: 254 - 274
Evaluating Network Reliability and 2-Edge-Connected Reliability in Linear Time for Bounded Pathwidth Graphs C. LucetJ.-F. ManouvrierJ. Carlier Pages: 316 - 336
Faster Algorithms for Subgraph Isomorphism of \sl k -Connected Partial \sl k -Trees A. DessmarkA. LingasA. Proskurowski Pages: 337 - 347
Definability Equals Recognizability of Partial 3-Trees and \sl k -Connected Partial \sl k -Trees D. Kaller Pages: 348 - 381
Memory Requirements for Table Computations in Partial \sl k -Tree Algorithms B. AspvallJ. A. TelleA. Proskurowski Pages: 382 - 394
