Graph domination, coloring and cliques in telecommunications
From MaRDI portal
(Redirected from Publication:5294075)
Recommendations
Cited in
(21)- Spanning trees with a constraint on the number of leaves. A new formulation
- Topology design for on-demand dual-path routing in wireless networks
- Wireless networking, dominating and packing
- An efficient local search algorithm for solving maximum edge weight clique problem in large graphs
- SCCWalk: an efficient local search algorithm and its improvements for maximum weight clique problem
- A review on algorithms for maximum clique problems
- Distance-based clique relaxations in networks: s-clique and s-club
- Benders decomposition, branch-and-cut, and hybrid algorithms for the minimum connected dominating set problem
- The minimum spanning k-core problem with bounded CVaR under probabilistic edge failures
- Hypergraph theory in wireless communication networks
- A Fast Vertex Weighting-Based Local Search for Finding Minimum Connected Dominating Sets
- A Semi-exact Algorithm for Quickly Computing A Maximum Weight Clique in Large Sparse Graphs
- Analysis of self-equilibrated networks through cellular modelling
- Graph-Theoretic Concepts in Computer Science
- On atomic cliques in temporal graphs
- Learning driven three-phase search for the maximum independent union of cliques problem
- Exact and heuristic algorithms for the domination problem
- Graph coloring via degeneracy in streaming and other space-conscious models
- Theoretical studies of the k-strong Roman domination problem
- A parity domination problem in graphs with bounded treewidth and distance-hereditary graphs
- Reformulations and solution algorithms for the maximum leaf spanning tree problem
This page was built for publication: Graph domination, coloring and cliques in telecommunications
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5294075)
