Asset Details
Do you wish to reserve the book?
ILIGRA: An Efficient Inverse Line Graph Algorithm
Hey, we have placed the reservation for you!
By the way, why not check out events that you can attend while you pick your title.
Oops! Something went wrong.
Looks like we were not able to place the reservation. Kindly try again later.
Are you sure you want to remove the book from the shelf?
ILIGRA: An Efficient Inverse Line Graph Algorithm
Do you wish to request the book?
ILIGRA: An Efficient Inverse Line Graph Algorithm
Please be aware that the book you have requested cannot be checked out. If you would like to checkout this book, you can reserve another copy
We have requested the book for you!
Your request is successful and it will be processed during the Library working hours. Please check the status of your request in My Requests.
Oops! Something went wrong.
Looks like we were not able to place your request. Kindly try again later.
Journal Article
ILIGRA: An Efficient Inverse Line Graph Algorithm
2015
Overview
This paper presents a new and efficient algorithm,
IligraLIGRA
, for inverse line graph construction. Given a line graph
H
, I
LIGRA
constructs its root graph
G
with the time complexity being linear in the number of nodes in
H
. If I
LIGRA
does not know whether the given graph
H
is a line graph, it firstly assumes that
H
is a line graph and starts its root graph construction. During the root graph construction, I
LIGRA
checks whether the given graph
H
is a line graph and I
LIGRA
stops once it finds
H
is not a line graph. The time complexity of I
LIGRA
with line graph checking is linear in the number of links in the given graph
H
. For sparse line graphs of any size and for dense line graphs of small size, numerical results of the running time show that I
LIGRA
outperforms all currently available algorithms.
Publisher
Springer Netherlands,Springer Nature B.V
