An efficient reconstruction of a graph from its line graph in parallel
From MaRDI portal
Publication:3201774
Recommendations
Cited in
(11)- ILIGRA: an efficient inverse line graph algorithm
- scientific article; zbMATH DE number 4160789 (Why is no real title available?)
- Intersection graph of maximal stars
- Finding the root graph through minimum edge deletion
- Edge intersection graphs of linear 3-uniform hypergraphs
- scientific article; zbMATH DE number 140465 (Why is no real title available?)
- Edge intersection graphs of linear 3-uniform hypergraphs
- New results and open problems in line graphs
- A finite characterization and recognition of intersection graphs of hypergraphs with rank at most 3 and multiplicity at most 2 in the class of threshold graphs
- A dynamic algorithm for line graph recognition
- Minimizing the Hamming distance between a graph and a line-graph to discover the topology of an electrical network
This page was built for publication: An efficient reconstruction of a graph from its line graph in parallel
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3201774)