Full Text Available
Note: Clicking the button above will open the full text document at the original institutional repository in a new window.
Efficient Label-Constrained Path Queries on Time-Dependent Graphs via LP-Tree Decomposition
Saved in:
| Published in: | Data Science and Engineering |
|---|---|
| Format: | Online Article RSS Article |
| Published: |
2026
|
| Subjects: | |
| Tags: |
No Tags, Be the first to tag this record!
|
| _version_ | 1867301675662835713 |
|---|---|
| collection | WordPress RSS FRELIP Feed Integration |
| container_title | Data Science and Engineering |
| description | |
| discipline_display | Computer Science |
| discipline_facet | Computer Science |
| format | Online Article RSS Article |
| genre | Journal Article |
| id | rss_article:78127 |
| institution | FRELIP |
| journal_source_facet | Data Science and Engineering |
| publishDate | 2026 |
| publishDateSort | 2026 |
| record_format | rss_article |
| spellingShingle | Efficient Label-Constrained Path Queries on Time-Dependent Graphs via LP-Tree Decomposition Computer Science General Computer Science |
| sub_discipline_display | General |
| sub_discipline_facet | General |
| subject_display | Computer Science General Computer Science Computer Science General Computer Science |
| subject_facet | Computer Science General Computer Science |
| title | Efficient Label-Constrained Path Queries on Time-Dependent Graphs via LP-Tree Decomposition |
| title_auth | Efficient Label-Constrained Path Queries on Time-Dependent Graphs via LP-Tree Decomposition |
| title_full | Efficient Label-Constrained Path Queries on Time-Dependent Graphs via LP-Tree Decomposition |
| title_fullStr | Efficient Label-Constrained Path Queries on Time-Dependent Graphs via LP-Tree Decomposition |
| title_full_unstemmed | Efficient Label-Constrained Path Queries on Time-Dependent Graphs via LP-Tree Decomposition |
| title_short | Efficient Label-Constrained Path Queries on Time-Dependent Graphs via LP-Tree Decomposition |
| title_sort | efficient label-constrained path queries on time-dependent graphs via lp-tree decomposition |
| topic | Computer Science General Computer Science |
| url | https://link.springer.com/article/10.1007/s41019-026-00345-x |