vix.ing · top · new · best · stats · spec

The complexity of path coloring and call scheduling

2001/03/01 by Thomas Erlebach, Klaus Jansen · 2 citations
Computer Science · Engineering · Mathematics · #Advanced Graph Theory Research #Advanced Optical Network Technologies #Approximation algorithm #Combinatorics #Communication complexity #Complete coloring #Computer science #Discrete mathematics #Fractional coloring #Graph #Graph coloring #Interconnection Networks and Systems #Mathematical optimization #Mathematics #Scheduling (production processes) #Time complexity

paper · doi:10.1016/s0304-3975(99)00152-8

crossref issued 2001/03/01 · crossref published 2001/03/01 · crossref published-print 2001/03/01 · openalex publication_date 2001/03/01 · crossref created 2002/07/25 · crossref deposited 2020/01/28 · openalex created_date 2025/10/10 · crossref indexed 2026/05/16 · openalex updated_date 2026/07/23

Citations

Cited by