Intuitionistic fuzzy shortest hyperpath in a network
From MaRDI portal
Publication:2444846
DOI10.1016/j.ipl.2013.05.004zbMath1284.68474MaRDI QIDQ2444846
S. Thilagavathi, Parvathi Rangasamy, Muhammad Akram
Publication date: 11 April 2014
Published in: Information Processing Letters (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ipl.2013.05.004
algorithms; accuracy; combinatorial problems; scores; intuitionistic fuzzy number; intuitionistic fuzzy hypergraph; directed intuitionistic fuzzy hypergraph; intuitionistic fuzzy shortest hyperpath
68M10: Network design and communication in computer systems
05C65: Hypergraphs
68R10: Graph theory (including graph drawing) in computer science
05C38: Paths and cycles
05C72: Fractional graph theory, fuzzy graph theory
Related Items
Certain notions of picture fuzzy information with applications, A new method for the solution of fully fuzzy linear programming models, Certain concepts of bipolar fuzzy directed hypergraphs, New concepts of interval-valued intuitionistic (S, T)-fuzzy graphs, Strong and superstrong vertices in intuitionistic fuzzy graphs
Cites Work
- On intuitionistic fuzzy sets theory
- Intuitionistic fuzzy sets
- Fuzzy sets and systems. Theory and applications
- The fuzzy shortest path length and the corresponding shortest path in a network
- Directed hypergraphs and applications
- Intuitionistic fuzzy hypergraphs with applications
- Strong intuitionistic fuzzy graphs
- Unnamed Item