scientific article; zbMATH DE number 5521183

zbMATH Open1164.05456MaRDI QIDQ3607082FDOQ3607082

V. Chernyakhivs'kyj

Publication date: 28 February 2009

Title of this publication is not available (Why is that?)

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)

Cited In (1)

• Title not available (Why is that?)

   Recommendations

• Title not available (Why is that?) 👍 👎
• An efficient algorithm for finding the largest chain graph according to a given chain graph 👍 👎
• Title not available (Why is that?) 👍 👎
• 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 👍 👎

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)