Graph optimization problems on a Bethe lattice

1989 ◽  
Vol 54 (1-2) ◽  
pp. 477-493 ◽  
Author(s):  
Mário J. de Oliveira
Keyword(s):  
Optimization Problems ◽  
Bethe Lattice ◽  
Graph Optimization

scholarly journals Priority algorithms for graph optimization problems

2010 ◽  
Vol 411 (1) ◽  
pp. 239-258 ◽  
Author(s):  
Allan Borodin ◽  
Joan Boyar ◽  
Kim S. Larsen ◽  
Nazanin Mirmohammadi
Keyword(s):  
Optimization Problems ◽  
Priority Algorithms ◽  
Graph Optimization

scholarly journals Dynamic programming and graph optimization problems

1994 ◽  
Vol 27 (9-10) ◽  
pp. 53-58
Author(s):  
T.C. Hu ◽  
J.D. Morgenthaler
Keyword(s):  
Dynamic Programming ◽  
Optimization Problems ◽  
Graph Optimization

scholarly journals A Hierarchy of Subgraph Projection-Based Semidefinite Relaxations for Some NP-Hard Graph Optimization Problems

2015 ◽  
Vol 53 (1) ◽  
pp. 40-48 ◽  
Author(s):  
Elspeth Adams ◽  
Miguel F. Anjos ◽  
Franz Rendl ◽  
Angelika Wiegele
Keyword(s):  
Optimization Problems ◽  
Np Hard ◽  
Semidefinite Relaxations ◽  
Graph Optimization

scholarly journals Self-Stabilizing Global Optimization Algorithms for Large Network Graphs

2005 ◽  
Vol 1 (3-4) ◽  
pp. 329-344 ◽  
Author(s):  
Wayne Goddard ◽  
Stephen T. Hedetniemi ◽  
David P. Jacobs ◽  
Pradip K. Srimani
Keyword(s):  
Global Optimization ◽  
Distributed Algorithms ◽  
Optimization Problems ◽  
Dominating Set ◽  
Optimization Algorithms ◽  
Large Network ◽  
Shared Variable ◽  
Large Networks ◽  
Total Dominating Set ◽  
Graph Optimization

The paradigm of self-stabilization provides a mechanism to design efficient localized distributed algorithms that are proving to be essential for modern day large networks of sensors. We provide self-stabilizing algorithms (in the shared-variable ID-based model) for three graph optimization problems: a minimal total dominating set (where every node must be adjacent to a node in the set) and its generalizations, a maximal k-packing (a set of nodes where every pair of nodes are more than distance k apart), and a maximal strong matching (a collection of totally disjoint edges).

Sign in / Sign up

Export Citation Format

Share Document