Identifying and Locating–Dominating Codes in (Random) Geometric Networks

Combinatorics Probability and Computing - United Kingdom
doi 10.1017/s0963548309990344
Full Text
Abstract

Available in full text

Date
Authors
Publisher

Cambridge University Press (CUP)

Related search

Open-Independent, Open-Locating-Dominating Sets

Electronic Journal of Graph Theory and Applications
CombinatoricsApplied MathematicsDiscrete Mathematics
2017English

Dominating Biological Networks

PLoS ONE
Multidisciplinary
2011English

A Comparison of Known Codes, Random Codes, and the Best Codes

IEEE Transactions on Information Theory
Computer Science ApplicationsInformation SystemsLibraryInformation Sciences
1998English

Locating Throughput Bottlenecks in Home Networks

2014English

Codes Identifying Bad Signatures in Batches

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2000English

Locating Central Actors in Co-Offending Networks

2011English

Vertices Belonging to All or to No Minimum Locating Dominating Sets of Trees

Opuscula Mathematica
Mathematics
2009English

Random Walk With Jumps in Large-Scale Random Geometric Graphs

Computer Communications
Computer NetworksCommunications
2010English

Detecting and Locating Non-Technical Losses in Modern Distribution Networks

IEEE Transactions on Smart Grid
Computer Science
2018English

Amanote Research

Note-taking for researchers

Follow Amanote

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

Privacy PolicyRefund Policy