Editorial: Special issue on graph algorithms

DOI10.3390/a6030457zbMath1461.05003OpenAlexW1969434758MaRDI QIDQ1736576

No author found.

Publication date: 26 March 2019

Published in: Algorithms (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.3390/a6030457

zbMATH Keywords

computational complexityheuristicsgraph algorithmsapproximation algorithmsfixed-parameter tractabilityexact algorithmscomputational studies

Mathematics Subject Classification ID

Proceedings, conferences, collections, etc. pertaining to combinatorics (05-06) Collections of articles of miscellaneous specific interest (00B15) Graph algorithms (graph-theoretic aspects) (05C85)

Related Items (1)

Multiaspect graphs: algebraic representation and algorithms

Cites Work

• Exact algorithms for maximum clique: a computational study
• Extracting co-occurrence relations from ZDDs
• Maximum disjoint paths on edge-colored graphs: approximability and tractability
• Computational study on a PTAS for planar dominating set problem
• Tractabilities and intractabilities on geometric intersection graphs
• Dubins traveling salesman problem with neighborhoods: a graph-based approach
• Computing the eccentricity distribution of large graphs
• A polynomial-time algorithm for computing the maximum common connected edge subgraph of outerplanar graphs of bounded degree
• New heuristics for rooted triplet consistency

This page was built for publication: Editorial: Special issue on graph algorithms