Amanote Research

Amanote Research

    RegisterSign In

Private Computation — K-Connected Versus 1-Connected Networks

Lecture Notes in Computer Science - Germany
doi 10.1007/3-540-45708-9_13
Full Text
Open PDF
Abstract

Available in full text

Categories
Computer ScienceTheoretical Computer Science
Date

January 1, 2002

Authors
Markus BläserAndreas JakobyMaciej LiśkiewiczBodo Siebert
Publisher

Springer Berlin Heidelberg


Related search

Critical Conditions for Connected-K-Coverage in Sensor Networks

IEEE Communications Letters
Electronic EngineeringSimulationComputer Science ApplicationsElectricalModeling
2008English

Energy-Efficient Location-Independent K-Connected Scheme in Wireless Sensor Networks*

English

Connected Dominating Set Construction Algorithm for Wireless Networks Based on Connected Subset

Journal of Communications
2016English

Connected Locally Connected Toposes Are Path-Connected

Transactions of the American Mathematical Society
MathematicsApplied Mathematics
1986English

Diffusion in Nanopore Connected Bilayer Networks

Biophysical Journal
Biophysics
2019English

Minimally Locally 1-Connected Graphs

Bulletin of the Australian Mathematical Society
Mathematics
1978English

Minimally Strong Subgraph (K,l)-Arc-Connected Digraphs

Discussiones Mathematicae - Graph Theory
CombinatoricsApplied MathematicsDiscrete Mathematics
2020English

A 4 + Ε Approximation for K-Connected Subgraphs

2020English

A Survey of Partially Connected Neural Networks

International Journal of Neural Systems
MedicineComputer NetworksCommunications
1997English

Amanote Research

Note-taking for researchers

Follow Amanote

© 2025 Amaplex Software S.P.R.L. All rights reserved.

Privacy PolicyRefund Policy