Editorial: Special issue on graph algorithms
From MaRDI portal
Summary: This special issue of \textit{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.
Recommendations
- Guest editors' foreword: Special issue on selected papers from the 15th international workshop on algorithms and computation (WALCOM 2021)
- Guest editorial: Special issue on combinatorial optimization and applications
- Preface
- Editorial: Special issue on computing and combinatorics
- Special issue on selected papers from the 12th international workshop on algorithms and computation (WALCOM 2018)
Cites work
- A polynomial-time algorithm for computing the maximum common connected edge subgraph of outerplanar graphs of bounded degree
- Computational study on a PTAS for planar dominating set problem
- Computing the eccentricity distribution of large graphs
- Dubins traveling salesman problem with neighborhoods: a graph-based approach
- Exact algorithms for maximum clique: a computational study
- Extracting co-occurrence relations from ZDDs
- Maximum disjoint paths on edge-colored graphs: approximability and tractability
- New heuristics for rooted triplet consistency
- Tractabilities and intractabilities on geometric intersection graphs
Cited in
(5)
This page was built for publication: Editorial: Special issue on graph algorithms
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1736576)