ARTÍCULO
TITULO

Dominating Sets in Planar Graphs: Branch-Width and Exponential Speed-Up

 Artículos similares

       
 
Sambor Guze    
Nowadays, transport is the basis for the functioning of national, continental, and global economies. Thus, many governments recognize it as a critical element in ensuring the daily existence of societies in their countries. Those responsible for the prop... ver más
Revista: Algorithms

 
Stephen Finbow and Christopher M. van Bommel    
For a graph ??=(??,??) G = ( V , E ) , the ?? ? -graph of G, denoted ??(??)=(??(??),??(??)) G ( ? ) = ( V ( ? ) , E ( ? ) ) , is the graph whose vertex set is the collection of minimum dominating sets, or ?? ? -sets of G, and two ?? ? -sets are adjacent ... ver más
Revista: Algorithms

 
Julius Toeri and Marie-Pierre Laborie    
The thermal and swelling properties of a series of azacrown ether-crosslinked chitosans prepared with varying molar amounts of N,N-diallyl-7,13-diaza-1,7,10,16-tetraoxa-dibenzo-18-crown-6 (molar equivalents ranging from 0, 0.125, 0.167, 0.25 and 0.5) fil... ver más
Revista: ChemEngineering

 
Mahmoud Saoud     Pág. 321 - 324
This paper concerns the domination numbers ?(Pkx Pn) for the complete Pkx Pn grid graphs for k = 7, 8, 9 and for all n = 1. These numbers were previously established (BONDY; MURTY, 2008; CHANG; CLARK, 1993). Here we present dominating sets by other metho... ver más

 
Stojmenovic, I; Seddigh, M; Zunic, J     Pág. 14 - 25