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
Article Menu

Export Article

Open AccessEditorial
Algorithms 2013, 6(3), 457-458; doi:10.3390/a6030457

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]

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. View Full-Text
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).

Scifeed alert for new publications

Never miss any articles matching your research from any publisher
  • Get alerts for new papers matching your research
  • Find out the new papers from selected authors
  • Updated daily for 49'000+ journals and 6000+ publishers
  • Define your Scifeed now

SciFeed Share & Cite This Article

MDPI and ACS Style

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

Show more citation formats Show less citations formats

Related Articles

Article Metrics

Article Access Statistics

1

Comments

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