<--- Back to Details
First PageDocument Content
Dining cryptographers problem / Connected component / Tree / Induced path / Vertex / Public-key cryptography / Graph / Graph theory / Mathematics / Cryptography
Date: 2007-03-31 14:33:35
Dining cryptographers problem
Connected component
Tree
Induced path
Vertex
Public-key cryptography
Graph
Graph theory
Mathematics
Cryptography

J. Cryptology[removed]:[removed]Journal of Cryptology

Add to Reading List

Source URL: www.cs.ucsb.edu

Download Document from Source Website

File Size: 700,95 KB

Share Document on Facebook

Similar Documents

Finding an induced path of given parity in planar graphs in polynomial time Marcin Kami´nski ∗ Naomi Nishimura†

DocID: 1s12G - View Document

Graph theory / Bipartite graphs / Planar graphs / Induced path / NP-complete problems / Parity graph

Induced paths of given parity in planar graphs Naomi Nishimura University of Waterloo Canada

DocID: 1rsEH - View Document

NP-complete problems / Travelling salesman problem / Induced path / Shortest path problem / Graph / Routing / Combinatorial optimization / Path / Hamiltonian path / Graph theory / Theoretical computer science / Mathematics

Optimization of Cable Cycles: A Trade-off between Reliability and Cost Master Thesis in Micro-data Analysis Author: Barsam Payvar

DocID: 1g2wf - View Document

Graph connectivity / Combinatorial optimization / Graph coloring / Connectivity / Induced path / K-edge-connected graph / Matching / Cut / Graph / Graph theory / Mathematics / Theoretical computer science

Randomized Algorithms 2015A Lecture 5 – Edge Sparsification for Cuts∗ Robert Krauthgamer 1

DocID: 1aFtk - View Document

Network theory / Cartography / Robotic mapping / Shortest path problem / Induced path / Topological graph theory / Routing / Graph / Routing algorithms / Graph theory / Mathematics / Theoretical computer science

OntoNav: A Semantic Indoor Navigation System

DocID: 1aA1B - View Document