Pages that link to "Item:Q2731130"
From MaRDI portal
The following pages link to The optimal sequential and parallel algorithms to compute all hinge vertices on interval graphs (Q2731130):
Displaying 9 items.
- The recognition of geodetically connected graphs (Q293190) (← links)
- \(L(2,1)\)-labeling of interval graphs (Q500005) (← links)
- A linear time algorithm for finding all hinge vertices of a permutation graph (Q671396) (← links)
- An efficient algorithm for finding all hinge vertices on trapezoid graphs (Q1405798) (← links)
- Recognizing hinge-free line graphs and total graphs (Q1596464) (← links)
- (Q3561694) (← links)
- An optimal algorithm to find minimum k-hop dominating set of interval graphs (Q4634287) (← links)
- Optimal sequential and parallel algorithms for computing the diameter and the center of an interval graph (Q4870967) (← links)
- An efficient distributed algorithm for finding all hinge vertices in networks (Q5466762) (← links)