⌘+K

Pulse Explore Communities Researchers Journals

Home Communities Explore

January 1, 1987Networks

A linear time algorithm to check for the existence of a rectangular dual of a planar triangulated graph

Jayaram Bhasker Sartaj Sahni

View at Publisher

Ask AI

Bookmark

Share

Abstract

We develop a linear time algorithm to determine if a given planar triangulated graph has a rectangular dual.

Discussion

No takes yet. Share an insight, caveat, or question.

Cite This Study

Bhasker et al. (1987) studied this question.

synapsesocial.com/papers/6aaf547484c19a519ba5f5c9 https://doi.org/10.1002/net.3230170306

View at Publisher

Ask AI

Bookmark

Share

Keep reading

Synapse has enriched 5 related papers. Consider them for comparative context:

1Branch‐and‐Cut POPMUSIC for the Electric Vehicle Routing Problem With Time WindowsNetworks · Fri,
2The Active‐Passive Vehicle Routing Problem With Item TransshipmentsNetworks · Wed,
3Multicommodity Trade Network Equilibrium With Mixed Demand and Food SecurityNetworks · Sun,
4Exact Solution of Picker Routing Problems in Zoned Warehouses With Scattered StorageNetworks · Thu,
5Algorithmic and Optimization Strategies for Efficient Routing and Resource Management in Advanced Elastic Optical NetworksNetworks · Wed,

More from Networks

A Decomposition Approach for Large Virtual Network EmbeddingThu,
Fault‐Tolerant Mutual‐Visibility: Complexity and Solutions for Grid‐Like NetworksSat,
Shelters and Multiple Shots in a Hunters and Rabbit GameThu,
Maximizing SDN Resilience to Node‐Targeted Attacks—A Game‐Theoretic ApproachSat,
Maximum Number of Requests on a Path With a Given Grooming FactorTue,