Disjoint Identifying-Codes for Arbitrary Graphs

doi 10.1109/isit.2005.1523331
Full Text
Abstract

Available in full text

Date
Authors
Publisher

IEEE

Related search

Searching Cycle-Disjoint Graphs

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
English

Finding Disjoint Paths on Directed Acyclic Graphs

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2005English

Arc-Disjoint In-Trees in Directed Graphs

Combinatorica
CombinatoricsComputational MathematicsDiscrete Mathematics
2009English

Induced Disjoint Paths in Claw-Free Graphs

SIAM Journal on Discrete Mathematics
Mathematics
2015English

Efficient Algorithms for Listing K Disjoint St-Paths in Graphs

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2018English

Corrigendum: Edge-Disjoint Paths in Expander Graphs

SIAM Journal on Computing
MathematicsComputer Science
2001English

Complexity of Disjoint Paths Problems in Planar Graphs

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
1993English

On Vertex Identifying Codes for Infinite Lattices

English

Compact Support Biorthogonal Wavelet Filterbanks for Arbitrary Undirected Graphs

IEEE Transactions on Signal Processing
Electronic EngineeringSignal ProcessingElectrical
2013English

Amanote Research

Note-taking for researchers

Follow Amanote

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

Privacy PolicyRefund Policy