The Nova Graph: more disjoint paths with minimal graph augmentation

MaRDI QIDQ5443263zbMATH OpenFDO

Authors Jeffery J. Boats, Lazaros D. Kikas, John Oleksik

Publication date 20 February 2008

zbMATH Keywords

interconnection networksalternating group graphvertex disjoint paths

Mathematics Subject Classification ID

Graphs and abstract algebra (groups, rings, fields, etc.) (05C25) Paths and cycles (05C38)

Recommendations

• Finding disjoint paths in the nova graph
• An algebraic approach for finding disjoint paths in the alternating group graph
• One-to-one disjoint path covers on alternating group graphs
• scientific article; zbMATH DE number 714464
• An efficient algorithm for k-pairwise disjoint paths in star graphs

Cited in

(4)

• Finding disjoint paths in the nova graph
• An algebraic approach for finding disjoint paths 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

This page was built for publication: The Nova Graph: more disjoint paths with minimal graph augmentation

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