Boolean approaches to graph embeddings related to VLSI (Q1609705): Difference between revisions

From MaRDI portal
RedirectionBot (talk | contribs)
Removed claim: author (P16): Item:Q176697
ReferenceBot (talk | contribs)
Changed an Item
 
(2 intermediate revisions by 2 users not shown)
Property / author
 
Property / author: Yanpei Liu / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4716822 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Some combinatorial optimization problems arising from VLSI circuit design / rank
 
Normal rank
Property / cites work
 
Property / cites work: At most single-bend embeddings of cubic graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Theoretical results on at most 1-bend embeddability of graphs / 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: Q2725986 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A graph partition problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: A linear algorithm for 2-bend embeddings of planar graphs in the two-dimensional grid / rank
 
Normal rank
Property / cites work
 
Property / cites work: Boolean approach to planar embeddings of a graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5289554 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Boolean planarity characterization of graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Boolean characterizations of planarity and planar embeddings of graphs / rank
 
Normal rank

Latest revision as of 14:57, 4 June 2024

scientific article
Language Label Description Also known as
English
Boolean approaches to graph embeddings related to VLSI
scientific article

    Statements