ILIGRA: an efficient inverse line graph algorithm (Q894425): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Emergence of Scaling in Random Networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2743189 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3069645 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4828550 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3267900 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4039929 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5837982 / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Optimal Algorithm to Detect a Line Graph and Output Its Root Graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: Clustering in random line graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4702188 / rank
 
Normal rank
Property / cites work
 
Property / cites work: An efficient reconstruction of a graph from its line graph in parallel / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3291034 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A \(max \{m, n \}\) algorithm for determining the graph H from its line graph G / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3360912 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3066830 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The interchange graph of a finite graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: Congruent Graphs and the Connectivity of Graphs / rank
 
Normal rank

Latest revision as of 03:07, 11 July 2024

scientific article
Language Label Description Also known as
English
ILIGRA: an efficient inverse line graph algorithm
scientific article

    Statements

    Identifiers