A better heuristic for orthogonal graph drawings (Q1384200): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
Set OpenAlex properties.
 
(6 intermediate revisions by 5 users not shown)
Property / author
 
Property / author: Therese C. Biedl / rank
Normal rank
 
Property / author
 
Property / author: Therese C. Biedl / rank
 
Normal rank
Property / Wikidata QID
 
Property / Wikidata QID: Q56689781 / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimal orthogonal drawings of triconnected plane graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: A linear algorithm for embedding planar graphs using PQ-trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithms for drawing graphs: An annotated bibliography / rank
 
Normal rank
Property / cites work
 
Property / cites work: An experimental comparison of four graph drawing algorithms. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computing an st-numbering / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4028111 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Drawing planar graphs using the canonical ordering / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5596083 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3997942 / rank
 
Normal rank
Property / cites work
 
Property / cites work: General theoretical results on rectilinear embeddability of graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Drawing graphs on rectangular grids / rank
 
Normal rank
Property / cites work
 
Property / cites work: On minimal-node-cost planar embeddings / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Embedding a Graph in the Grid with the Minimum Number of Bends / rank
 
Normal rank
Property / cites work
 
Property / cites work: Lower bounds for planar orthogonal drawings of graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computing multivariate polynomials in parallel / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/s0925-7721(97)00026-6 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2117205241 / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 11:17, 30 July 2024

scientific article
Language Label Description Also known as
English
A better heuristic for orthogonal graph drawings
scientific article

    Statements

    Identifiers