Contents

Journal of Combinatorial Mathematics and Combinatorial Computing

  • Research article

A pansophy algorithm

Jeffery J. Boats1, Lazaros D. Kikas1, John K. Slowik2
1University of Detroit Mercy 4001 W. McNichols Road, Detroit, MI 48221-3038
2Northeastern University

Abstract

Given a graph \( G \), we are interested in finding disjoint paths for a given set of distinct pairs of vertices. In 2017, we formally defined a new parameter, the pansophy of \( G \), in the context of the disjoint path problem. In this paper, we develop an algorithm for computing the pansophy of graphs and illustrate the algorithm on graphs where the pansophy is already known. We close with future research directions.

Keywords: Interconnection networks, graphs, algorithms, vertex disjoint paths, pansophy.
Information
Guidelines
CP Initiatives
Follow CP
Facebook X-twitter Linkedin

1970-2025 CP (Manitoba, Canada) unless otherwise stated.

Citation
Jeffery J. Boats, Lazaros D. Kikas, John K. Slowik. A pansophy algorithm[J], Journal of Combinatorial Mathematics and Combinatorial Computing, Volume 114. 47-57. .