Matches in SemOpenAlex for { <https://semopenalex.org/work/W3200465660> ?p ?o ?g. }
Showing items 1 to 46 of
46
with 100 items per page.
- W3200465660 endingPage "91" @default.
- W3200465660 startingPage "75" @default.
- W3200465660 abstract "A plane graph is called a rectangular graph if each of its edges can be oriented either horizontally or vertically, each of its interior regions is a four-sided region and all interior regions can be fitted in a rectangular enclosure. If the dual of a plane graph is a rectangular graph, then the plane graph is a rectangularly dualizable graph. A rectangular dual is it area-universal if any assignment of areas to each of its regions can be realized by a combinatorially weak equivalent rectangular dual. It is still unknown that there exists no polynomial time algorithm to construct an area-universal rectangular dual for a rectangularly dualizable graph . In this paper, we describe a class of rectangularly dualizable graphs wherein each graph can be realized by an area-universal rectangular dual. We also present a polynomial time algorithm for its construction." @default.
- W3200465660 created "2021-09-27" @default.
- W3200465660 creator A5013443795 @default.
- W3200465660 creator A5068014820 @default.
- W3200465660 date "2021-08-20" @default.
- W3200465660 modified "2023-10-16" @default.
- W3200465660 title "RECTANGULARLY DUALIZABLE GRAPHS: AREA-UNIVERSALITY" @default.
- W3200465660 doi "https://doi.org/10.17654/dm028010075" @default.
- W3200465660 hasPublicationYear "2021" @default.
- W3200465660 type Work @default.
- W3200465660 sameAs 3200465660 @default.
- W3200465660 citedByCount "0" @default.
- W3200465660 crossrefType "journal-article" @default.
- W3200465660 hasAuthorship W3200465660A5013443795 @default.
- W3200465660 hasAuthorship W3200465660A5068014820 @default.
- W3200465660 hasBestOaLocation W32004656601 @default.
- W3200465660 hasConcept C121332964 @default.
- W3200465660 hasConcept C183992945 @default.
- W3200465660 hasConcept C41008148 @default.
- W3200465660 hasConcept C62520636 @default.
- W3200465660 hasConceptScore W3200465660C121332964 @default.
- W3200465660 hasConceptScore W3200465660C183992945 @default.
- W3200465660 hasConceptScore W3200465660C41008148 @default.
- W3200465660 hasConceptScore W3200465660C62520636 @default.
- W3200465660 hasIssue "1" @default.
- W3200465660 hasLocation W32004656601 @default.
- W3200465660 hasLocation W32004656602 @default.
- W3200465660 hasOpenAccess W3200465660 @default.
- W3200465660 hasPrimaryLocation W32004656601 @default.
- W3200465660 hasRelatedWork W1587914261 @default.
- W3200465660 hasRelatedWork W1955000819 @default.
- W3200465660 hasRelatedWork W2355134505 @default.
- W3200465660 hasRelatedWork W2359380292 @default.
- W3200465660 hasRelatedWork W2370848225 @default.
- W3200465660 hasRelatedWork W2748952813 @default.
- W3200465660 hasRelatedWork W2899084033 @default.
- W3200465660 hasRelatedWork W3115068090 @default.
- W3200465660 hasRelatedWork W332573842 @default.
- W3200465660 hasRelatedWork W88570232 @default.
- W3200465660 hasVolume "28" @default.
- W3200465660 isParatext "false" @default.
- W3200465660 isRetracted "false" @default.
- W3200465660 magId "3200465660" @default.
- W3200465660 workType "article" @default.