ILIGRA: an efficient inverse line graph algorithm
DOI10.1007/S10852-014-9251-2zbMATH Open1347.05239OpenAlexW2106452164MaRDI QIDQ894425FDOQ894425
Authors: Dajie Liu, Stojan Trajanovski, Piet Van Mieghem 
Publication date: 1 December 2015
Published in: Journal of Mathematical Modelling and Algorithms in Operations Research (Search for Journal in Brave)
Full work available at URL: http://resolver.tudelft.nl/uuid:aabe6d90-0681-4139-9a6d-201e70843ead
Recommendations
- An efficient reconstruction of a graph from its line graph in parallel
- scientific article; zbMATH DE number 3974289
- scientific article; zbMATH DE number 3987319
- Linear-time graph algorithms in GP 2
- scientific article; zbMATH DE number 176590
- An Efficient Implementation of Sugiyama's Algorithm for Layered Graph Drawing
- Graph Drawing
- An Almost Linear-Time Algorithm for Graph Realization
- Straight-line drawing algorithms for hierarchical graphs and clustered graphs
- An Incremental Linear-Time Algorithm for Recognizing Interval Graphs
Graph algorithms (graph-theoretic aspects) (05C85) Analysis of algorithms and problem complexity (68Q25) Graph operations (line graphs, products, etc.) (05C76)
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Emergence of Scaling in Random Networks
- Title not available (Why is that?)
- Title not available (Why is that?)
- A \(max \{m, n \}\) algorithm for determining the graph H from its line graph G
- Random graphs.
- Congruent Graphs and the Connectivity of Graphs
- Title not available (Why is that?)
- Title not available (Why is that?)
- The interchange graph of a finite graph
- Graph spectra for complex networks
- Title not available (Why is that?)
- An Optimal Algorithm to Detect a Line Graph and Output Its Root Graph
- An efficient reconstruction of a graph from its line graph in parallel
- Clustering in random line graphs
- Title not available (Why is that?)
Cited In (9)
- New results and open problems in line graphs
- Minimizing the Hamming distance between a graph and a line-graph to discover the topology of an electrical network
- A dynamic algorithm for line graph recognition
- An efficient reconstruction of a graph from its line graph in parallel
- Finding the root graph through minimum edge deletion
- ILIGRA
- Degree distribution and assortativity in line graphs of complex networks
- Graphs with least eigenvalue \(-2\): ten years on
- Biclique graphs of interval bigraphs
Uses Software
This page was built for publication: ILIGRA: an efficient inverse line graph algorithm
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q894425)
