Special Issue on Graph Algorithms
This special issue of Algorithms is devoted to the design and analysis of algorithms for solving combinatorial problems of a theoretical or practical nature involving graphs, with a focus on computational complexity.
Main Author: | Jesper Jansson |
---|---|
Format: | Article |
Language: | English |
Published: |
MDPI AG
2013-08-01
|
Series: | Algorithms |
Subjects: | |
Online Access: | http://www.mdpi.com/1999-4893/6/3/457 |
Similar Items
-
Algorithms For Low-Distortion Embeddings Into Geometrically Restricted Spaces
by: Carpenter, Timothy E.
Published: (2019) -
Measure-Driven Algorithm Design and Analysis: A New Approach for Solving NP-hard Problems
by: Liu, Yang
Published: (2010) -
A Parameterized Approximation Algorithm for the Chromatic k-Median Problem
by: Zhen Zhang, et al.
Published: (2021-01-01) -
Special Issue on “Graph Algorithms and Applications”
by: Serafino Cicerone, et al.
Published: (2021-05-01) -
Parameterized Complexity of Maximum Edge Coloring in Graphs
by: Goyal, Prachi
Published: (2018)