Publication | Closed Access

Efficient parallel algorithms for finding maximal cliques, clique trees, and minimum coloring on chordal graphs

Clique TreesNetwork ScienceGraph TheoryEngineeringAlgebraic Graph TheoryStructural Graph TheoryExtremal Graph TheoryPlanar GraphNetwork AnalysisEducationComputational ComplexityParallel ProgrammingComputer ScienceMaximal CliquesDiscrete MathematicsEfficient Parallel AlgorithmsCombinatorial OptimizationGraph Algorithm