Shortest path under rational constraint (Q1113687): Difference between revisions
From MaRDI portal
Created a new Item |
ReferenceBot (talk | contribs) Changed an Item |
||
| (3 intermediate revisions by 3 users not shown) | |||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1016/0020-0190(88)90198-6 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2037998882 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q4773298 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: An efficient Dijkstra-like labeling method for computing shortest odd/even paths / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q4079524 / rank | |||
Normal rank | |||
| links / mardi / name | links / mardi / name | ||
Latest revision as of 10:25, 19 June 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Shortest path under rational constraint |
scientific article |
Statements
Shortest path under rational constraint (English)
0 references
1988
0 references
We make use of finite automata theory in order to solve some shortest path problems under constraint in valuated graphs.
0 references
rational language
0 references
shortest path under constraint
0 references
operational research
0 references
finite automata
0 references
valuated graphs
0 references
