Next Article in Journal
Ubiquitous Integrity via Network Integration and Parallelism—Sustaining Pedestrian/Bike Urbanism
Previous Article in Journal
A Review of Routing Protocols Based on Ant-Like Mobile Agents
Previous Article in Special Issue
New Heuristics for Rooted Triplet Consistency
Algorithms 2013, 6(3), 457-458; doi:10.3390/a6030457
Editorial

Special Issue on Graph Algorithms

Laboratory of Mathematical Bioinformatics, Bioinformatics Center, Institute for Chemical Research, Kyoto University, Gokasho, Uji, Kyoto 611-0011, Japan
Received: 9 August 2013 / Revised: 9 August 2013 / Accepted: 9 August 2013 / Published: 12 August 2013
(This article belongs to the Special Issue Graph Algorithms)
View Full-Text   |   Download PDF [38 KB, uploaded 12 August 2013]
SciFeed

Abstract

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.
Keywords: graph algorithms; computational complexity; fixed-parameter tractability; exact algorithms; approximation algorithms; heuristics; computational studies graph algorithms; computational complexity; fixed-parameter tractability; exact algorithms; approximation algorithms; heuristics; computational studies
This is an open access article distributed under the Creative Commons Attribution License (CC BY 3.0).

Share & Cite This Article

Further Mendeley | CiteULike
Export to BibTeX |
EndNote |
RIS
MDPI and ACS Style

Jansson, J. Special Issue on Graph Algorithms. Algorithms 2013, 6, 457-458.

View more citation formats

Related Articles

Article Metrics

For more information on the journal, click here

Comments

[Return to top]
Algorithms EISSN 1999-4893 Published by MDPI AG, Basel, Switzerland RSS E-Mail Table of Contents Alert