Computation of diameter, radius and center of permutation graphs
From MaRDI portal
Publication:6115743
DOI10.1142/s1793830922500392zbMath1516.05211OpenAlexW3210169157MaRDI QIDQ6115743
Sukumar Mondal, Unnamed Author, Sambhu Charan Barman
Publication date: 13 July 2023
Published in: Discrete Mathematics, Algorithms and Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1142/s1793830922500392
Analysis of algorithms and problem complexity (68Q25) Enumeration in graph theory (05C30) Distance in graphs (05C12) Graph algorithms (graph-theoretic aspects) (05C85)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- An optimal greedy heuristic to color interval graphs
- An efficient algorithm to find next-to-shortest path on permutation graphs
- Computation of the center and diameter of outerplanar graphs
- Breadth-first traversal of trees and integer sorting in parallel
- Efficient algorithms for finding depth-first and breadth-first search trees in permutation graphs
- An optimal algorithm to solve the all-pairs shortest paths problem on permutation graphs
- A linear-time algorithm for solving the center problem on weighted cactus graphs
- Fast diameter and radius BFS-based computation in (weakly connected) real-world graphs
- A simple linear-time algorithm for computing the center of an interval graph
- Incremental modular decomposition
- Approximation and Fixed Parameter Subquadratic Algorithms for Radius and Diameter in Sparse Graphs
- Optimal sequential and parallel algorithms for computing the diameter and the center of an interval graph
- An optimal algorithm to find minimum k-hop connected dominating set of permutation graphs
- A novel graph invariant: The third leap Zagreb index under several graph operations
- Error Correction Coding
- Subcubic Equivalences Between Graph Centrality Problems, APSP and Diameter
- Transitive Orientation of Graphs and Identification of Permutation Graphs
- Depth-First Search and Linear Graph Algorithms
This page was built for publication: Computation of diameter, radius and center of permutation graphs
