Finding fixed-length circuits and cycles in undirected edge-weighted graphs: an application with street networks
- Location
-
Deutsche Nationalbibliothek Frankfurt am Main
- ISSN
-
1572-9397
- Extent
-
Online-Ressource
- Language
-
Englisch
- Notes
-
online resource.
- Bibliographic citation
-
Finding fixed-length circuits and cycles in undirected edge-weighted graphs: an application with street networks ; volume:28 ; number:3 ; day:23 ; month:3 ; year:2022 ; pages:259-285 ; date:6.2022
Journal of heuristics ; 28, Heft 3 (23.3.2022), 259-285, 6.2022
- Creator
- Contributor
-
SpringerLink (Online service)
- DOI
-
10.1007/s10732-022-09493-5
- URN
-
urn:nbn:de:101:1-2022071011232413145912
- Rights
-
Open Access; Der Zugriff auf das Objekt ist unbeschränkt möglich.
- Last update
-
15.08.2025, 7:23 AM CEST
Data provider
This object is provided by:
Deutsche Nationalbibliothek. If you have any questions about the object, please contact the data provider.
Deutsche Nationalbibliothek. If you have any questions about the object, please contact the data provider.
Associated
- Lewis, Rhyd
- Corcoran, P.
- SpringerLink (Online service)
Other Objects (12)
Some algorithmic results for finding compatible spanning circuits in edge-colored graphs
Hitting weighted even cycles in planar graphs
Hitting weighted even cycles in planar graphs
Boundary value problems in weighted edge spaces
Rainbow Cycles in Properly Edge-Colored Graphs
Finding Optimal Triangulations Parameterized by Edge Clique Cover
Edge Eigenface Weighted Hausdorff Distance for Face Recognition
Four-point condition matrices of edge-weighted trees
Efficient solution for finding Hamilton cycles in undirected graphs
Edge-preserving image decomposition via joint weighted least squares
Longest cycles in cyclically 4-edge-connected cubic planar graphs
Detecting complexes from edge-weighted PPI networks via genes expression analysis
Some algorithmic results for finding compatible spanning circuits in edge-colored graphs
Hitting weighted even cycles in planar graphs
Hitting weighted even cycles in planar graphs
Boundary value problems in weighted edge spaces
Rainbow Cycles in Properly Edge-Colored Graphs
Finding Optimal Triangulations Parameterized by Edge Clique Cover
Edge Eigenface Weighted Hausdorff Distance for Face Recognition
Four-point condition matrices of edge-weighted trees
Efficient solution for finding Hamilton cycles in undirected graphs
Edge-preserving image decomposition via joint weighted least squares
Longest cycles in cyclically 4-edge-connected cubic planar graphs
Detecting complexes from edge-weighted PPI networks via genes expression analysis
Some algorithmic results for finding compatible spanning circuits in edge-colored graphs
Hitting weighted even cycles in planar graphs
Hitting weighted even cycles in planar graphs
Boundary value problems in weighted edge spaces
Rainbow Cycles in Properly Edge-Colored Graphs
Finding Optimal Triangulations Parameterized by Edge Clique Cover
Edge Eigenface Weighted Hausdorff Distance for Face Recognition
Four-point condition matrices of edge-weighted trees
Efficient solution for finding Hamilton cycles in undirected graphs
Edge-preserving image decomposition via joint weighted least squares
Longest cycles in cyclically 4-edge-connected cubic planar graphs