Algorithms for Optimal Paths Finding on the Graphs With Reference to Different Forest Logistics Tasks in the Forest Com-Plex and Biofuel Engineering

Resources and Technology
doi 10.15393/j2.art.2010.1741
Full Text
Abstract

Available in full text

Date
Authors
Publisher

Petrozavodsk State University

Related search

Query Optimal K-Plex Based Community in Graphs

Data Science and Engineering
Computational MechanicsComputer Science Applications
2017English

Finding Disjoint Paths on Directed Acyclic Graphs

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2005English

Impact of Modelling Choices on Setting the Reference Levels for the EU Forest Carbon Sinks: How Do Different Assumptions Affect the Country-Specific Forest Reference Levels?

Carbon Balance and Management
Planetary ChangePlanetary SciencesMonitoringGlobalManagementPolicyEarthLaw
2019English

A Flexible Approach for Finding Optimal Paths With Minimal Conflicts

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2017English

Efficient Algorithms for Listing K Disjoint St-Paths in Graphs

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2018English

Optimal Parallel Algorithms for Finding Proximate Points, With Applications

IEEE Transactions on Parallel and Distributed Systems
HardwareComputational TheorySignal ProcessingArchitectureMathematics
1998English

More Algorithms for All-Pairs Shortest Paths in Weighted Graphs

2007English

Finding Paths in Sparse Random Graphs Requires Many Queries

Random Structures and Algorithms
MathematicsApplied MathematicsComputer GraphicsComputer-Aided DesignSoftware
2016English

An Optimal Algorithm for Shortest Paths on Weighted Interval and Circular-Arc Graphs, With Applications

Algorithmica
Applied MathematicsComputer Science ApplicationsComputer Science
1995English

Amanote Research

Note-taking for researchers

Follow Amanote

© 2024 Amaplex Software S.P.R.L. All rights reserved.

Privacy PolicyRefund Policy