scientific article; zbMATH DE number 5521183

MaRDI QIDQ3607082zbMATH OpenFDO

Authors V. Chernyakhivs'kyj

Publication date 28 February 2009

zbMATH Keywords

graphadjacency matrixsimple chainrecurssearching with return

Mathematics Subject Classification ID

Graph algorithms (graph-theoretic aspects) (05C85) Graph theory (including graph drawing) in computer science (68R10) Extremal problems in graph theory (05C35) Searching and sorting (68P10) Paths and cycles (05C38)

Recommendations

• scientific article; zbMATH DE number 6102919
• An efficient algorithm for finding the largest chain graph according to a given chain graph
• scientific article; zbMATH DE number 5521219
• Algorithms for longest chains in pseudo-transitive graphs
• Algorithms for finding a maximum non-\(k\)-linked graph
• Algorithms for finding a maximum non-\(k\)-linked graph
• Maximum incomplete recursive circulants in graph embeddings
• A recovery algorithm for chain graphs

Cited in

(1)

• scientific article; zbMATH DE number 5521219 (Why is no real title available?)

This page was built for publication:

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