Affiliation:
1. Fireman's Fund American Insurance Companies, P.O. Box 3395, San Francisco, California
Abstract
Given a graph
H
with
E
edges and
N
nodes, a graph
G
is sought such that
H
is the line graph of
G
, if
G
exists. The algorithm does this within the order of
E
steps, in fact in
E
+
O
(
N
) steps. This algorithm is optimal in its complexity.
Publisher
Association for Computing Machinery (ACM)
Subject
Artificial Intelligence,Hardware and Architecture,Information Systems,Control and Systems Engineering,Software
Cited by
124 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献