A labeling algorithm to recognize a line digraph and output its root graph
From MaRDI portal
Publication:1163377
DOI10.1016/0020-0190(82)90080-1zbMATH Open0483.68062OpenAlexW2077380997WikidataQ56388861 ScholiaQ56388861MaRDI QIDQ1163377FDOQ1163377
Authors: Maciej M. Sysło 
Publication date: 1982
Published in: Information Processing Letters (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0020-0190(82)90080-1
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)
