Entity usage
From MaRDI portal
This page lists pages that use the given entity (e.g. Q42). The list is sorted by descending page ID, so that newer pages are listed first.
Showing below up to 44 results in range #1 to #44.
- Publication:5554160: Title
- On designing a network to defend against random attacks of radius two: Label: en, Title
- The 2-path network problem: Title
- Graph-Theoretic Concepts in Computer Science: Title
- Augmenting Graphs to Meet Edge-Connectivity Requirements: Title
- Two Edge-Disjoint Hop-Constrained Paths and Polyhedra: Title
- Edge-Connectivity Augmentation Preserving Simplicity: Title
- An algorithm for construction of ak-connected graph with minimum number of edges and quasiminimal diameter: Title
- The minimum spanning k-core problem with bounded CVaR under probabilistic edge failures: Title, Label: en
- A branch-and-cut-and-price algorithm for vertex-biconnectivity augmentation: Title
- Grigory Pastukhov: Title, Label: en
- Graph-Theoretic Concepts in Computer Science: Title
- On Critical Graphs of Diameter 2: Title
- Analysis and design of robust network clusters with bounded diameter: Label: en, Title
- Robustness and strong attack tolerance of low-diameter networks: Label: en, Title
- Simpler and faster biconnectivity augmentation: Title
- On designing a network to defend against random attacks of radius two: Label: en, Title
- Two Edge-Disjoint Hop-Constrained Paths and Polyhedra: Title
- The 2-path network problem: Title
- Edge-Connectivity Augmentation Preserving Simplicity: Title
- Augmentation Problems: Title
- Optimal attack and reinforcement of a network: Title
- An algorithm for construction of ak-connected graph with minimum number of edges and quasiminimal diameter: Title
- The minimum spanning k-core problem with bounded CVaR under probabilistic edge failures: Title, Label: en
- A branch-and-cut-and-price algorithm for vertex-biconnectivity augmentation: Title
- A computational investigation of heuristic algorithms for 2-edge-connectivity augmentation: Title
- scientific article; zbMATH DE number 1617267: Title
- Novel approaches for analyzing biological networks: Title
- On the k edge-disjoint 2-hop-constrained paths polytope: Title
- On the number of edges in a graph with many two-hop disjoint paths: Title, Label: en
- Optimal design and augmentation of strongly attack-tolerant two-hop clusters in directed networks: Title, Miscellaneous (e.g. entity existence), Label: en, Some statements, Sitelink
- New formulations and solution procedures for the hop constrained network design problem.: Title
- On the directed hop-constrained shortest path problem: Title
- Minimal oriented graphs of diameter 2: Title
- On the minimum-cardinality-bounded-diameter and the bounded-cardinality- minimum-diameter edge addition problems: Title
- Hop-constrained node survivable network design: An application to MPLS over WDM: Title
- Analytical characterizations of some classes of optimal strongly attack-tolerant networks and their Laplacian spectra: Label: en, Title
- Identifying large robust network clusters via new compact formulations of maximum k-club problems: Title
- The k edge-disjoint 3-hop-constrained paths polytope: Title
- Augmenting Graphs to Meet Edge-Connectivity Requirements: Title
- Alexander Veremyev: Title, Label: en
- Grigory Pastukhov: Title, Label: en
- Eduardo L. Pasiliao: Title, Label: en
- Vladimir Boginski: Title, Label: en