z-logo
open-access-imgOpen Access
A Fast Longer Path Algorithm for Routing Grid with Obstacles Using Biconnectivity Based Length Upper Bound
Author(s) -
Yukihide Kohira,
Suguru Suehiro,
Atsushi Takahashi
Publication year - 2009
Publication title -
ieice transactions on fundamentals of electronics communications and computer sciences
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.188
H-Index - 52
eISSN - 1745-1337
pISSN - 0916-8508
DOI - 10.1587/transfun.e92.a.2971
Subject(s) - equal cost multi path routing , static routing , computer science , link state routing protocol , destination sequenced distance vector routing , routing (electronic design automation) , multipath routing , dynamic source routing , algorithm , path (computing) , path vector protocol , policy based routing , routing table , distributed computing , computer network , routing protocol

The content you want is available to Zendy users.

Already have an account? Click here to sign in.
Having issues? You can contact us here
Accelerating Research

Address

John Eccles House
Robert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom