5 papers:
ICALP-v2-2012-KosowskiLNS #graph- k-Chordal Graphs: From Cops and Robber to Compact Routing via Treewidth (AK, BL, NN, KS), pp. 610–622.
- ICALP-2002-Uehara #algorithm #graph #linear
- Linear Time Algorithms on Chordal Bipartite and Strongly Chordal Graphs (RU), pp. 993–1004.
- ICALP-1995-ParraS #graph #how
- How to Use the Minimal Separators of a Graph for its Chordal Triangulation (AP, PS), pp. 123–134.
STOC-1987-NaorNS #algorithm #graph #parallel #performance- Fast Parallel Algorithms for Chordal Graphs (Extended Abstract) (JN, MN, AAS), pp. 355–364.
PODS-1985-AusielloDM #concept #graph #modelling #semantics- Chordality Properties on Graphs and Minimal Conceptual Connections in Semantic Data Models (GA, AD, MM), pp. 164–170.
