A labeling algorithm to recognize a line digraph and output its root graph
From MaRDI portal
(Redirected from Publication:1163377)
Cites work
Cited in
(18)- New results and open problems in line graphs
- Parallel \(N\)-free order recognition
- N-free posets as generalizations of series-parallel posets
- Minimizing the jump number for partially ordered sets: A graph-theoretic approach
- Characterization of classical graph classes by weighted clique graphs
- Dominoes
- The forbidden minor characterization of line-search antimatroids of rooted digraphs
- Transitive closure for restricted classes of partial orders
- On finding the jump number of a partial order by substitution decomposition
- Minimizing completion time for a class of scheduling problems
- On Page Number of N-free Posets
- Reconstructing a graph from its arc incidence graph
- \(N\)-free orders and minimal interval extensions
- An algorithm for minimizing setups in precedence constrained scheduling
- Optimal constructions of reversible digraphs
- Review of properties of different precedence graphs for scheduling problems
- On some complexity properties of N-free posets and posets with bounded decomposition diameter
- Parallel interval order recognition and construction of interval representations
This page was built for publication: A labeling algorithm to recognize a line digraph and output its root graph
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1163377)
