Pages that link to "Item:Q1098312"
From MaRDI portal
The following pages link to Some parallel algorithms on interval graphs (Q1098312):
Displaying 17 items.
- New sequential and parallel algorithms for interval graph recognition (Q922725) (← links)
- A parallel algorithm for generating bicompatible elimination orderings of proper interval graphs (Q989571) (← links)
- Parallel circle-cover algorithms (Q1108792) (← links)
- On the domatic number of interval graphs (Q1111388) (← links)
- Efficient parallel algorithms for finding maximal cliques, clique trees, and minimum coloring on chordal graphs (Q1111390) (← links)
- Optimal parallel algorithms for finding cut vertices and bridges of interval graphs (Q1198065) (← links)
- Efficient parallel recognition of some circular arc graphs. I (Q1209733) (← links)
- Clustering bipartite and chordal graphs: Complexity, sequential and parallel algorithms (Q1283779) (← links)
- The \(k\)-neighbor, \(r\)-domination problems on interval graphs (Q1342074) (← links)
- Parallel algorithms for connectivity problems on interval graphs (Q1350233) (← links)
- Parallel algorithms for the domination problems in trapezoid graphs (Q1356505) (← links)
- Scalable parallel algorithms for maximum matching and Hamiltonian circuit in convex bipartite graphs (Q2283031) (← links)
- Parallel algorithms on interval graphs (Q4359285) (← links)
- A parallel algorithm to generate all maximal independent sets on permutation graphs (Q4392327) (← links)
- Parallel computation on interval graphs: algorithms and experiments (Q4790934) (← links)
- O(1) QUERY TIME ALGORITHM FOR ALL PAIRS SHORTEST DISTANCES ON INTERVAL GRAPHS (Q5249020) (← links)
- Parallel algorithms on circular-arc graphs (Q5899761) (← links)
