Pages that link to "Item:Q1111390"
From MaRDI portal
The following pages link to Efficient parallel algorithms for finding maximal cliques, clique trees, and minimum coloring on chordal graphs (Q1111390):
Displaying 14 items.
- Selection of programme slots of television channels for giving advertisement: a graph theoretic approach (Q881882) (← links)
- A parallel algorithm for minimum weighted colouring of triangulated graphs (Q1193908) (← links)
- Counting clique trees and computing perfect elimination schemes in parallel (Q1262131) (← links)
- The maximum clique problem (Q1318271) (← links)
- The parallel solution of domination problems on chordal and strongly chordal graphs (Q1331893) (← links)
- An efficient parallel algorithm for the minimal elimination ordering (MEO) of an arbitrary graph (Q1341730) (← links)
- Scheduling algorithm to select optimal programme slots in television channels: a graph theoretic approach (Q1791804) (← links)
- Parallel computation of perfect elimination schemes using partition techniques on triangulated graphs (Q1842819) (← links)
- Minimum Average Distance Clique Trees (Q2947438) (← links)
- Parallel Algorithms for Maximal Cliques in Circle Graphs and Unrestricted Depth Search (Q3060200) (← links)
- An Efficient Algorithm to Generate all Maximal Cliques on Trapezoid Graphs (Q3147308) (← links)
- An efficient algorithm to generate all maximal independent sets on trapezoid graphs (Q4240618) (← links)
- Distributed algorithms for maximum cliques (Q4338575) (← links)
- A parallel algorithm to generate all maximal independent sets on permutation graphs (Q4392327) (← links)
