2008 International Symposium on Computational Intelligence and Design 2008
DOI: 10.1109/iscid.2008.100
|View full text |Cite
|
Sign up to set email alerts
|

A New Approach for the Shortest Path Problem with Vague Sets

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1

Citation Types

0
1
0

Year Published

2009
2009
2020
2020

Publication Types

Select...
2
2

Relationship

0
4

Authors

Journals

citations
Cited by 4 publications
(1 citation statement)
references
References 10 publications
0
1
0
Order By: Relevance
“…There are several existing algorithm that can find shortest path. The shortest path problem is vital to various applications including routing [1] [5]. However, the problem of computing the shortest paths data has acquired little attention in the literature [2].…”
Section: Introductionmentioning
confidence: 99%
“…There are several existing algorithm that can find shortest path. The shortest path problem is vital to various applications including routing [1] [5]. However, the problem of computing the shortest paths data has acquired little attention in the literature [2].…”
Section: Introductionmentioning
confidence: 99%