scientific article; zbMATH DE number 1788241

zbMATH Open0999.05064MaRDI QIDQ4550483

Cornelius Croitoru, Mihai Talmaciu

Publication date: 25 August 2002

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

characterizationcommunication networksperfect graphsgraph connectivitygraph search algorithmconfidentially connected graphs

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Connectivity (05C40)

Recommendations

• Unnamed Item 👍 👎
• Unnamed Item 👍 👎
• Secret-sharing schemes for very dense graphs 👍 👎
• Algorithmic aspects of secure connected domination in graphs 👍 👎
• Percolation in the secrecy graph 👍 👎
• Secret sharing schemes on graphs 👍 👎
• On Linear Secret Sharing for Connectivity in Directed Graphs 👍 👎
• ABOUT SECURE INDEPENDENCE IN GRAPHS 👍 👎
• Secure Hypergraphs: Privacy from Partial Broadcast 👍 👎
• Privacy-Preserving Graph Algorithms in the Semi-honest Model 👍 👎

This page was built for publication: