Pages that link to "Item:Q5756716"
From MaRDI portal
The following pages link to Optimal Linear Arrangement of Interval Graphs (Q5756716):
Displaying 17 items.
- Treewidth and minimum fill-in on permutation graphs in linear time (Q708222) (← links)
- A Lex-BFS-based recognition algorithm for Robinsonian matrices (Q1786881) (← links)
- The distance orientation problem (Q2091816) (← links)
- On an ordering problem in weighted hypergraphs (Q2115861) (← links)
- Linear time algorithms to solve the linear ordering problem for oriented tree based graphs (Q2805488) (← links)
- Malod and the Pascaline (Q2821699) (← links)
- Mixed search number and linear-width of interval and split graphs (Q3057182) (← links)
- Minimum Linear Arrangement of Series-Parallel Graphs (Q3453293) (← links)
- Mixed Search Number and Linear-Width of Interval and Split Graphs (Q3508577) (← links)
- Lower and upper bounds for the linear arrangement problem on interval graphs (Q4634312) (← links)
- A note on minimum linear arrangement for BC graphs (Q4634526) (← links)
- Ordering a Sparse Graph to Minimize the Sum of Right Ends of Edges (Q5041192) (← links)
- Minimum Linear Arrangement of the Cartesian Product of Optimal Order Graph and Path (Q5087084) (← links)
- Cutwidth of Split Graphs, Threshold Graphs, and Proper Interval Graphs (Q5302057) (← links)
- Maximum cut on interval graphs of interval count four is NP-complete (Q6124829) (← links)
- Complexity of maximum cut on interval graphs (Q6174803) (← links)
- Semi-proper interval graphs (Q6648246) (← links)
