An efficient PQ-graph algorithm for solving the graph-realization problem (Q1142044): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Q4773298 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Converting Linear Programs to Network Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Testing for the consecutive ones property, interval graphs, and graph planarity using PQ-tree algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graphs and Vector Spaces / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5624818 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Network flow, transportation and scheduling. Theory and algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Synthesis of Switching Functions by Linear Graph Theory / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3285875 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Efficiency of a Good But Not Linear Set Union Algorithm / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Algorithm for Determining Whether a Given Binary Matroid is Graphic / rank
 
Normal rank
Property / cites work
 
Property / cites work: From Matrices to Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5524326 / rank
 
Normal rank

Latest revision as of 05:34, 13 June 2024

scientific article
Language Label Description Also known as
English
An efficient PQ-graph algorithm for solving the graph-realization problem
scientific article

    Statements