An algebraic approach for finding disjoint paths in the alternating group graph

MaRDI QIDQ3507253zbMATHFDO

Authors Jeffe Boats, Lazaros D. Kikas, John Oleksik

Publication date 18 June 2008

zbMATH Keywords

graphsCayley graphsinterconnection networksalgebraic algorithmlarge scale computingalternating group graphvertex disjoint pathsdisjoint path property

Mathematics Subject Classification ID

Graph algorithms (graph-theoretic aspects) (05C85) Graph theory (including graph drawing) in computer science (68R10) Graphs and abstract algebra (groups, rings, fields, etc.) (05C25) Paths and cycles (05C38) Distributed systems (68M14)

Recommendations

• An algorithm for finding disjoint paths in the alternating group graph
• One-to-one disjoint path covers on alternating group graphs
• A disjoint path problem in the alternating group graph
• The Nova Graph: more disjoint paths with minimal graph augmentation
• A new class of interconnection networks based on the alternating group

Cited in

(7)

• A well-equalized 3-CIST partition of alternating group graphs
• Finding disjoint paths in the nova graph
• The Nova Graph: more disjoint paths with minimal graph augmentation
• An algorithm 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
• On the construction of all shortest vertex-disjoint paths in Cayley graphs of abelian groups

This page was built for publication: An algebraic approach 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 Q3507253)