Pages that link to "Item:Q1001641"
From MaRDI portal
The following pages link to Discriminating codes in bipartite graphs: Bounds, extremal cardinalities, complexity (Q1001641):
Displayed 20 items.
- Identifying path covers in graphs (Q396675) (← links)
- Identification, location-domination and metric dimension on interval and permutation graphs. I: Bounds. (Q512651) (← links)
- On the \textsc{Distance Identifying Set} meta-problem and applications to the complexity of identifying problems on graphs (Q786037) (← links)
- Separating codes and traffic monitoring (Q1704860) (← links)
- Parameterized and approximation complexity of \textsc{Partial VC Dimension} (Q1731844) (← links)
- Decision and approximation complexity for identifying codes and locating-dominating sets in restricted graph classes (Q2018540) (← links)
- The \textsc{red-blue separation} problem on graphs (Q2169962) (← links)
- Fixed-parameter tractable algorithms for tracking shortest paths (Q2210499) (← links)
- Locating-dominating sets and identifying codes in graphs of girth at least 5 (Q2344817) (← links)
- Characterizing extremal digraphs for identifying codes and extremal cases of Bondy's theorem on induced subsets (Q2376092) (← links)
- Identification, location-domination and metric dimension on interval and permutation graphs. II: Algorithms and complexity (Q2408094) (← links)
- Extremal graphs for the identifying code problem (Q2430979) (← links)
- Watching systems in graphs: an extension of identifying codes (Q2446294) (← links)
- Separating Codes and Traffic Monitoring (Q2830061) (← links)
- Locating-Domination and Identification (Q3384611) (← links)
- Bounding the Order of a Graph Using Its Diameter and Metric Dimension: A Study Through Tree Decompositions and VC Dimension (Q4636778) (← links)
- On the Distance Identifying Set Meta-Problem and Applications to the Complexity of Identifying Problems on Graphs (Q5009472) (← links)
- Bounds and extremal graphs for total dominating identifying codes (Q6133156) (← links)
- The \textsc{Red-Blue Separation} problem on graphs (Q6168089) (← links)
- Extremal Digraphs for open neighbourhood location-domination and identifying codes (Q6202938) (← links)