Pages that link to "Item:Q1163377"
From MaRDI portal
The following pages link to A labeling algorithm to recognize a line digraph and output its root graph (Q1163377):
Displayed 18 items.
- Parallel interval order recognition and construction of interval representations (Q673637) (← links)
- Minimizing completion time for a class of scheduling problems (Q794156) (← links)
- Optimal constructions of reversible digraphs (Q801802) (← links)
- Minimizing the jump number for partially ordered sets: A graph-theoretic approach (Q1057887) (← links)
- An algorithm for minimizing setups in precedence constrained scheduling (Q1069848) (← links)
- On some complexity properties of N-free posets and posets with bounded decomposition diameter (Q1086264) (← links)
- On finding the jump number of a partial order by substitution decomposition (Q1092072) (← links)
- N-free posets as generalizations of series-parallel posets (Q1097286) (← links)
- Transitive closure for restricted classes of partial orders (Q1182064) (← links)
- \(N\)-free orders and minimal interval extensions (Q1207724) (← links)
- Parallel \(N\)-free order recognition (Q1392213) (← links)
- The forbidden minor characterization of line-search antimatroids of rooted digraphs (Q1410699) (← links)
- Review of properties of different precedence graphs for scheduling problems (Q1847252) (← links)
- Reconstructing a graph from its arc incidence graph (Q1926018) (← links)
- Characterization of classical graph classes by weighted clique graphs (Q2448923) (← links)
- On Page Number of N-free Posets (Q3439444) (← links)
- New results and open problems in line graphs (Q6101461) (← links)
- Dominoes (Q6184362) (← links)