B., Bhargavi and Rani, K. Swarupa and Neog, Arunjyoti (2022) Finding Multidimensional Constraint Reachable Paths for Attributed Graphs. EAI Endorsed Transactions on Scalable Information Systems.
![[thumbnail of 51637.pdf]](http://eprints.eai.eu/style/images/fileicons/application_pdf.png "51637.pdf")
PDF
51637.pdf
Download (3MB)
Abstract
A graph acts as a powerful modelling tool to represent complex relationships between objects in the big data era. Given two vertices, vertex and edge constraints, the multidimensional constraint reachable ( MCR) paths problem finds the path between the given vertices that match the user-specified co
| Item Type: | Article |
|---|---|
| Date Deposited: | 04 Mar 2026 15:45 |
| Last Modified: | 11 Apr 2026 11:45 |
| URI: | http://eprints.eai.eu/id/eprint/40710 |
Actions (login required)
- View Item