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

zbMATH Open1149.05023MaRDI QIDQ3507253FDOQ3507253

Authors: Jeffe Boats, Lazaros D. Kikas, John Oleksik 

Publication date: 18 June 2008

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

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)

Cited In (7)

• A disjoint path problem in the alternating group graph
• An algorithm for finding disjoint paths in the alternating group graph
• One-to-one disjoint path covers on alternating group graphs
• 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
• 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)