A dynamic algorithm for line graph recognition

DOI10.1007/3-540-60618-1_64OpenAlexW1536407537WikidataQ56388825 ScholiaQ56388825MaRDI QIDQ6122210FDOQ6122210

Authors: Klaus Simon 

Publication date: 28 February 2024

Published in: Graph-Theoretic Concepts in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/3-540-60618-1_64

Recommendations

• scientific article; zbMATH DE number 1455340
• scientific article; zbMATH DE number 4214062
• ILIGRA: an efficient inverse line graph algorithm
• scientific article; zbMATH DE number 3987319
• Algorithms and Data Structures

Mathematics Subject Classification ID

Graph algorithms (graph-theoretic aspects) (05C85) Graph operations (line graphs, products, etc.) (05C76)

Cites Work

• 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
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Improved data structures for fully dynamic biconnectivity
• Separator based sparsification for dynamic planar graph algorithms
• The interchange graph of a finite graph
• 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
• Zu einem Isomorphiesatz von H. Whitney für Graphen
• Title not available (Why is that?)

Cited In (1)

• A Polynomial Kernel for Line Graph Deletion

This page was built for publication: A dynamic algorithm for line graph recognition

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6122210)