FSTTCS 2004: Foundations of Software Technology and Theoretical Computer Science

DOI10.1007/B104325MaRDI QIDQ5465880zbMATH OpenOpenAlexFDO

Authors Mayur Thakur, Rahul Tripathi

Publication date 12 August 2005

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/b104325

Mathematics Subject Classification ID

Connectivity (05C40) Hypergraphs (05C65) Analysis of algorithms and problem complexity (68Q25)

Recommendations

• Linear connectivity problems in directed hypergraphs
• On the complexity of strongly connected components in directed hypergraphs
• Connectivity in directed hypergraphs
• Hardness and algorithms for variants of line graphs of directed graphs
• scientific article; zbMATH DE number 5535213
• Directed hypergraphs and applications
• On the complexity of the vector connectivity problem
• The linear complexity of a graph
• The linear complexity of a graph
• Directed hypergraphs and Horn minimization

Cited in

(4)

• Linear connectivity problems in directed hypergraphs
• scientific article; zbMATH DE number 5535213 (Why is no real title available?)
• On the complexity of strongly connected components in directed hypergraphs
• On finding hypercycles in chemical reaction networks

This page was built for publication: FSTTCS 2004: Foundations of Software Technology and Theoretical Computer Science

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