| nr |
titel |
auteur |
tijdschrift |
jaar |
jaarg. |
afl. |
pagina('s) |
type |
| 1 |
A Linear Algorithm for Finding \boldmath[{g,f }]-Colorings of Partial \boldmath{k }-Trees
|
Zhou, X.
|
|
Inc.
|
27 |
3-4 |
p. 227-243
|
artikel
|
| 2 |
Definability Equals Recognizability of Partial 3-Trees and \sl k -Connected Partial \sl k -Trees
|
Kaller, D.
|
|
Inc.
|
27 |
3-4 |
p. 348-381
|
artikel
|
| 3 |
Diameter and Treewidth in Minor-Closed Graph Families
|
Eppstein, D.
|
|
Inc.
|
27 |
3-4 |
p. 275-291
|
artikel
|
| 4 |
Dynamic Algorithms for Graphs of Bounded Treewidth
|
Hagerup, T.
|
|
Inc.
|
27 |
3-4 |
p. 292-315
|
artikel
|
| 5 |
Evaluating Network Reliability and 2-Edge-Connected Reliability in Linear Time for Bounded Pathwidth Graphs
|
Lucet, C.
|
|
Inc.
|
27 |
3-4 |
p. 316-336
|
artikel
|
| 6 |
Faster Algorithms for Subgraph Isomorphism of \sl k -Connected Partial \sl k -Trees
|
Dessmark, A.
|
|
Inc.
|
27 |
3-4 |
p. 337-347
|
artikel
|
| 7 |
Generalized Dominators for Structured Programs
|
Alstrup, S.
|
|
Inc.
|
27 |
3-4 |
p. 244-253
|
artikel
|
| 8 |
Graph Searching on Some Subclasses of Chordal Graphs
|
Peng, S.-L.
|
|
Inc.
|
27 |
3-4 |
p. 395-426
|
artikel
|
| 9 |
Introduction
|
Bodlaender, H. L.
|
|
Inc.
|
27 |
3-4 |
p. 209-211
|
artikel
|
| 10 |
Linear-Time Algorithms for Partial \boldmathk -Tree Complements
|
Gupta, A.
|
|
Inc.
|
27 |
3-4 |
p. 254-274
|
artikel
|
| 11 |
Memory Requirements for Table Computations in Partial \sl k -Tree Algorithms
|
Aspvall, B.
|
|
Inc.
|
27 |
3-4 |
p. 382-394
|
artikel
|
| 12 |
Shortest Paths in Digraphs of Small Treewidth. Part I: Sequential Algorithms
|
Chaudhuri, S.
|
|
Inc.
|
27 |
3-4 |
p. 212-226
|
artikel
|
Tijdschrift beschrijving