Separating Codes and Traffic Monitoring (Q2830061)

From MaRDI portal

Jump to:navigation, search

scientific article

Language	Label	Description	Also known as
English	Separating Codes and Traffic Monitoring	scientific article

Statements

scholarly article

0 references

Separating Codes and Traffic Monitoring (English)

0 references

zbMATH Open document ID

0 references

10.1007/978-3-319-41168-2_8

0 references

Thomas Bellitto

0 references

Algorithmic Aspects in Information and Management

0 references

publication date

9 November 2016

0 references

Mathematics Subject Classification ID

0 references

0 references

zbMATH DE Number

0 references

MaRDI profile type

MaRDI publication profile

0 references

full work available at URL

https://doi.org/10.1007/978-3-319-41168-2_8

0 references

0 references

Approximation algorithms for the test cover problem

0 references

Discriminating codes in bipartite graphs: Bounds, extremal cardinalities, complexity

0 references

Discriminating codes in (bipartite) planar graphs

0 references

Minimizing the size of an identifying or locating-dominating code in a graph is NP-hard.

0 references

0 references

On strongly identifying codes

0 references

0 references

On a new class of codes for identifying vertices in graphs

0 references

How complex are random graphs in first order logic?

0 references

Comments on "Derivation of Minimal Complete Sets of Test-Input Sequences Using Boolean Differences"

0 references

A Branch and Bound Algorithm for Feature Subset Selection

0 references

Open neighborhood locating-dominating in trees

0 references

Sitelinks

Mathematics(1 entry)

mardi Publication:2830061

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q2830061&oldid=36286441"