An algorithm for finding disjoint paths in the alternating group graph

MaRDI QIDQ3429527zbMATH OpenFDO

Authors Jeffe Boats, Lazaros D. Kikas, John Oleksik

Publication date 2 April 2007

zbMATH Keywords

alternating group graphdisjoint pathsinterconnection network

Mathematics Subject Classification ID

Graphs and abstract algebra (groups, rings, fields, etc.) (05C25) Paths and cycles (05C38) Graph algorithms (graph-theoretic aspects) (05C85)

Recommendations

• An algebraic approach for finding disjoint paths in the alternating group graph
• A disjoint path problem in the alternating group graph
• One-to-one disjoint path covers on alternating group graphs
• Two disjoint cycles of various lengths in alternating group graph
• The Nova Graph: more disjoint paths with minimal graph augmentation

Cited in

(4)

• A disjoint path problem in the alternating group graph
• An algebraic approach for finding disjoint paths in the alternating group graph
• One-to-one disjoint path covers on alternating group graphs
• Finding a shortest non-zero path in group-labeled graphs via permanent computation

This page was built for publication: An algorithm for finding disjoint paths in the alternating group graph

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3429527)