Thumbnail
Access Restriction
Subscribed

Author Lehot, Philippe G H
Source ACM Digital Library
Content type Text
Publisher Association for Computing Machinery (ACM)
File Format PDF
Copyright Year ©1974
Language English
Subject Domain (in DDC) Computer science, information & general works ♦ Data processing & computer science
Abstract Given a graph $\textit{H}$ with $\textit{E}$ edges and $\textit{N}$ nodes, a graph $\textit{G}$ is sought such that $\textit{H}$ is the line graph of $\textit{G},$ if $\textit{G}$ exists. The algorithm does this within the order of $\textit{E}$ steps, in fact in $\textit{E}$ + $\textit{O}(\textit{N})$ steps. This algorithm is optimal in its complexity.
ISSN 00045411
Age Range 18 to 22 years ♦ above 22 year
Educational Use Research
Education Level UG and PG
Learning Resource Type Article
Publisher Date 1974-10-01
Publisher Place New York
e-ISSN 1557735X
Journal Journal of the ACM (JACM)
Volume Number 21
Issue Number 4
Page Count 7
Starting Page 569
Ending Page 575


Open content in new tab

   Open content in new tab
Source: ACM Digital Library