Routing using implicit connection graphs [VLSI design]

No abstract is available for this paper.

• Publication year

  1996

• Venue

  Proceedings of 9th International Conference on VLSI Design

• Publication date

  1996-01-03

• Fields of study

  Mathematics, Computer Science, Engineering

• Identifiers
  DOI 10.1109/ICVD.1996.489453
• External record

  Open on Semantic Scholar

• Source metadata

  Semantic Scholar

• No claims are published for this paper.

• No concepts are published for this paper.

• Finding obstacle-avoiding shortest paths using implicit connection graphs

  1996cited by this paper
• Combinatorial algorithms for integrated circuit layout

  1990cited by this paper
• Rectilinear shortest paths in the presence of rectangular barriers

  1989cited by this paper
• Rectilinear shortest paths through polygonal obstacles in O(n(logn)2) time

  1987cited by this paper
• Rectilinear Shortest Paths and Minimum Spanning Trees in the Presence of Rectilinear Obstacles

  1987cited by this paper
• Rectilinear shortest paths with rectangular barriers

  1985cited by this paper
• A shortest path algorithm for grid graphs

  1977cited by this paper
• A Formal Basis for the Heuristic Determination of Minimum Cost Paths

  1968cited by this paper

• COVID19: Confinement Control based on a New Discrete Localization Algorithm (DLA)

  2020cites this paper
• Novel Algorithms for Some Fundamental Big Data Problems

  2018cites this paper
• An efficient Minimum Spanning Tree algorithm

  2016cites this paper
• Biologically Inspired Cooperative Routing for Wireless Mobile Sensor Networks

  2007cites this paper
• A Study on the Locality Behavior of Minimum Spanning Tree Algorithms

  2006cites this paper
• Designing irregular parallel algorithms with mutual exclusion and lock-free protocols

  2006cites this paper
• Fast shared-memory algorithms for computing the minimum spanning forest of sparse graphs

  2004cites this paper