|
|
|
|
Venues (Conferences, Journals, ...)
|
|
|
GrowBag graphs for keyword ? (Num. hits/coverage)
Group by:
The graphs summarize 663 occurrences of 246 keywords
|
|
|
|
|
Results
Found 657 publication records. Showing 657 according to the selection in the facets
| Hits ?▲ |
Authors |
Title |
Venue |
Year |
Link |
Author keywords |
| 4 | Qizhi Fang, Hye Kyung Kim |
A Note on Balancedness of Dominating Set Games.  |
J. Comb. Optim.  |
2005 |
DBLP DOI BibTeX RDF |
Lagrange dual, rigid dominating set game, relaxed dominating set game, core, balancedness |
| 4 | Qizhi Fang, Hye Kyung Kim, Dae Sik Lee |
Total Dominating Set Games.  |
WINE  |
2005 |
DBLP DOI BibTeX RDF |
Rigid total dominating set game, relaxed total dominating set game, core, balancedness, hard |
| 3 | Noga Alon, Shai Gutner |
Linear Time Algorithms for Finding a Dominating Set of Fixed Size in Degenerated Graphs.  |
Algorithmica  |
2009 |
DBLP DOI BibTeX RDF |
H-minor-free graphs, Degenerated graphs, Dominating set problem, Finding an induced cycle, Fixed-parameter tractable algorithms |
| 3 | Shai Gutner |
Polynomial Kernels and Faster Algorithms for the Dominating Set Problem on Graphs with an Excluded Minor.  |
IWPEC  |
2009 |
DBLP DOI BibTeX RDF |
H-minor-free graphs, degenerated graphs, dominating set problem, fixed-parameter tractable algorithms, problem kernel |
| 3 | Junmin Zhu |
Approximation for minimum total dominating set.  |
Int. Conf. Interaction Sciences  |
2009 |
DBLP DOI BibTeX RDF |
minimum total dominating set, approximation, reduction |
| 3 | Julien Schleich, Grégoire Danoy, Pascal Bouvry, Le Thi Hoai An |
Blackbone2, an efficient deterministic algorithm for creating 2-connected m-dominating set-based backbones in ad hoc networks.  |
MOBIWAC  |
2009 |
DBLP DOI BibTeX RDF |
k-connected m-dominating set, wireless sensor networks, localized algorithm |
| 3 | Weiping Shang, F. Frances Yao, Peng-Jun Wan, Xiaodong Hu |
On minimum m -connected k -dominating set problem in unit disc graphs.  |
J. Comb. Optim.  |
2008 |
DBLP DOI BibTeX RDF |
k-dominating set, m-connectivity, Unit disc graph, Wireless sensor networks, Approximation algorithm |
| 3 | Fedor V. Fomin, Fabrizio Grandoni, Dieter Kratsch |
Solving Connected Dominating Set Faster than 2 n .  |
Algorithmica  |
2008 |
DBLP DOI BibTeX RDF |
Exponential-time exact algorithm, Maximum leaf spanning tree, Connected dominating set, NP-hard problem |
| 3 | André Berger, Ojas Parekh |
Linear Time Algorithms for Generalized Edge Dominating Set Problems.  |
Algorithmica  |
2008 |
DBLP DOI BibTeX RDF |
Approximation algorithm, Trees, Edge dominating set |
| 3 | Jie Wu, Fei Dai, Shuhui Yang |
Iterative Local Solutions for Connected Dominating Set in Ad Hoc Wireless Networks.  |
IEEE Trans. Computers  |
2008 |
DBLP DOI BibTeX RDF |
dynamic node priority, local solution, simulation, wireless sensor networks (WSNs), mobile ad hoc networks (MANETs), Connected dominating set (CDS) |
| 3 | Zhao Zhang, Xiaofeng Gao, Weili Wu, Ding-Zhu Du |
PTAS for Minimum Connected Dominating Set in Unit Ball Graph.  |
WASA  |
2008 |
DBLP DOI BibTeX RDF |
wireless sensor network, connected dominating set, unit ball graph |
| 3 | Xianyue Li, Xiaofeng Gao, Weili Wu |
A Better Theoretical Bound to Approximate Connected Dominating Set in Unit Disk Graph.  |
WASA  |
2008 |
DBLP DOI BibTeX RDF |
Minimum Independent Set, Connected Dominating Set, Unit Disk Graph |
| 3 | Sayaka Kamei, Hirotsugu Kakugawa |
A Self-stabilizing Approximation for the Minimum Connected Dominating Set with Safe Convergence.  |
OPODIS  |
2008 |
DBLP DOI BibTeX RDF |
Minimum connected dominating set, Mobile ad hoc or sensor networks, Fault-tolerance, Approximation, Self-stabilization |
| 3 | Marjan Marzban, Qian-Ping Gu, Xiaohua Jia |
Computational Study on Dominating Set Problem of Planar Graphs.  |
COCOA  |
2008 |
DBLP DOI BibTeX RDF |
PLANAR DOMINATING SET, computational study, data reduction, fixed-parameter algorithms, branch-decomposition |
| 3 | Xiaofeng Gao, Yaochun Huang, Zhao Zhang, Weili Wu |
(6+epsilon)-Approximation for Minimum Weight Dominating Set in Unit Disk Graphs.  |
COCOON  |
2008 |
DBLP DOI BibTeX RDF |
Approximation algorithm, Dominating Set, Unit Disk Graph |
| 3 | Christian Scheideler, Andréa W. Richa, Paolo Santi |
An O(log n) dominating set protocol for wireless ad-hoc networks under the physical interference model.  |
MobiHoc  |
2008 |
DBLP DOI BibTeX RDF |
physical interference model, ad hoc networks, self-stabilization, dominating set |
| 3 | Yiwei Wu, Yingshu Li |
Construction algorithms for k-connected m-dominating sets in wireless sensor networks.  |
MobiHoc  |
2008 |
DBLP DOI BibTeX RDF |
k-connected m-dominating set, wireless sensor networks, fault-tolerance, localized algorithm, connected dominating set |
| 3 | Jurek Czyzowicz, Stefan Dobrev, Thomas Fevens, Hernández González-Aguilar, Evangelos Kranakis, Jaroslav Opatrny, Jorge Urrutia |
Local Algorithms for Dominating and Connected Dominating Sets of Unit Disk Graphs with Location Aware Nodes.  |
LATIN  |
2008 |
DBLP DOI BibTeX RDF |
Location awareness, Local algorithm, Dominating set, Connected dominating set, Unit disk graph, Approximation factor |
| 3 | Beat Gfeller, Elias Vicari |
A Faster Distributed Approximation Scheme for the Connected Dominating Set Problem for Growth-Bounded Graphs.  |
ADHOC-NOW  |
2007 |
DBLP DOI BibTeX RDF |
Growth-Bounded Graphs, Distributed Approximation Scheme, Distributed Algorithms, Connected Dominating Set |
| 3 | Weiping Shang, F. Frances Yao, Peng-Jun Wan, Xiaodong Hu |
Algorithms for Minimum m -Connected k -Dominating Set Problem.  |
COCOA  |
2007 |
DBLP DOI BibTeX RDF |
k-vertex connectivity, wireless sensor networks, approximation algorithm, Connected dominating set |
| 3 | Noga Alon, Shai Gutner |
Linear Time Algorithms for Finding a Dominating Set of Fixed Size in Degenerated Graphs.  |
COCOON  |
2007 |
DBLP DOI BibTeX RDF |
H-minor-free graphs, degenerated graphs, dominating set problem, finding an induced cycle, fixed-parameter tractable algorithms |
| 3 | Ashkan Aazami, Michael D. Stilp |
Approximation Algorithms and Hardness for Domination with Propagation.  |
APPROX-RANDOM  |
2007 |
DBLP DOI BibTeX RDF |
Power Dominating Set, Approximation Algorithms, Integer Programming, Planar Graphs, Greedy Algorithms, Dominating Set, Hardness of Approximation, PTAS |
| 3 | Miroslav Chlebík, Janka Chlebíková |
Approximation hardness of edge dominating set problems.  |
J. Comb. Optim.  |
2006 |
DBLP DOI BibTeX RDF |
Minimum edge dominating set, Minimum maximal matching, Approximation lower bound, Everywhere dense graphs, Bounded degree graphs |
| 3 | Jie Wu, Mihaela Cardei, Fei Dai, Shuhui Yang |
Extended Dominating Set and Its Applications in Ad Hoc Networks Using Cooperative Communication.  |
IEEE Trans. Parallel Distrib. Syst.  |
2006 |
DBLP DOI BibTeX RDF |
simulation, Ad hoc network, connectivity, dominating set, cooperative communication |
| 3 | Hui Liu, Yi Pan, Ivan Stojmenovic |
A Pure Localized Algorithm for Finding Connected Dominating Set in MANETs by Classification of Neighbors.  |
WASA  |
2006 |
DBLP DOI BibTeX RDF |
pure localized algorithm, routing, distributed algorithm, wireless ad hoc networks, connected dominating set |
| 3 | Peng-Jun Wan, Khaled M. Alzoubi, Ophir Frieder |
Distributed Construction of Connected Dominating Set in Wireless Ad Hoc Networks.  |
MONET  |
2004 |
DBLP DOI BibTeX RDF |
distributed algorithm, wireless ad hoc networks, spanning tree, leader election, connected dominating set, independent set |
| 3 | Jochen Alber, Michael R. Fellows, Rolf Niedermeier |
Polynomial-time data reduction for dominating set.  |
J. ACM  |
2004 |
DBLP DOI BibTeX RDF |
plannar graphs, problem kernel, NP-complete problems, dominating set, data reduction, fixed-parameter tractability |
| 3 | Khaled M. Alzoubi |
Connected Dominating Set and its Induced Position-less Sparse Spanner For Mobile Ad Hoc Networks.  |
ISCC  |
2003 |
DBLP DOI BibTeX RDF |
topological dilation, geometric dilation, connected dominating set, sparse spanner |
| 3 | Lichun Bao, J. J. Garcia-Luna-Aceves |
Topology management in ad hoc networks.  |
MobiHoc  |
2003 |
DBLP DOI BibTeX RDF |
ad hoc networks, connected dominating set, minimum dominating set |
| 3 | Laura A. Sanchis |
Experimental Analysis of Heuristic Algorithms for the Dominating Set Problem.  |
Algorithmica  |
2002 |
DBLP DOI BibTeX RDF |
Approximation algorithms, Dominating set, Test cases |
| 3 | Iyad A. Kanj, Ljubomir Perkovic |
Improved Parameterized Algorithms for Planar Dominating Set.  |
MFCS  |
2002 |
DBLP DOI BibTeX RDF |
planar dominating set, NP-complete problems, parameterized algorithms |
| 3 | Khaled M. Alzoubi, Peng-Jun Wan, Ophir Frieder |
New Distributed Algorithm for Connected Dominating Set in Wireless Ad Hoc Networks.  |
HICSS  |
2002 |
DBLP DOI BibTeX RDF |
distributed algorithm, wireless ad hoc networks, spanning tree, leader election, connected dominating set, independent set |
| 3 | John A. Ellis, Hongbing Fan, Michael R. Fellows |
The Dominating Set Problem Is Fixed Parameter Tractable for Graphs of Bounded Genus.  |
SWAT  |
2002 |
DBLP DOI BibTeX RDF |
graph, dominating set, fixed parameter algorithm, genus |
| 3 | Yuanzhu Peter Chen, Arthur L. Liestman |
Approximating minimum size weakly-connected dominating sets for clustering mobile ad hoc networks.  |
MobiHoc  |
2002 |
DBLP DOI BibTeX RDF |
weakly-connected dominating set, clustering, ad hoc network, distributed algorithm, dominating set |
| 3 | Jochen Alber, Hongbing Fan, Michael R. Fellows, Henning Fernau, Rolf Niedermeier, Frances A. Rosamond, Ulrike Stege |
Refined Search Tree Technique for DOMINATING SET on Planar Graphs.  |
MFCS  |
2001 |
DBLP DOI BibTeX RDF |
planar graph, dominating set, search tree, fixed parameter algorithm |
| 3 | Daniel Kobler, Udi Rotics |
Polynomial algorithms for partitioning problems on graphs with fixed clique-width (extended abstract).  |
SODA  |
2001 |
DBLP DOI BibTeX RDF |
coloring, dominating set, polynomial algorithms, edge-coloring, clique-width, edge-dominating set |
| 3 | Paola Alimonti, Tiziana Calamoneri |
Improved Approximations of Independent Dominating Set in Bounded Degree Graphs.  |
WG  |
1996 |
DBLP DOI BibTeX RDF |
Minimum Independent Dominating Set, Approximation Algorithms, Local Search, Greedy, Regular Graphs, Cubic Graphs, Bounded Degree Graphs |
| 2 | Rajiv Misra, Chittaranjan A. Mandal |
Minimum Connected Dominating Set Using a Collaborative Cover Heuristic for Ad Hoc Sensor Networks.  |
IEEE Trans. Parallel Distrib. Syst.  |
2010 |
DBLP DOI BibTeX RDF |
routing backbone, maximal independent set (MIS), Steiner tree, Connected dominating set (CDS) |
| 2 | Roy Friedman, Alex Kogan |
Brief announcement: deterministic dominating set construction in networks with bounded degree.  |
PODC  |
2010 |
DBLP DOI BibTeX RDF |
dominating sets, bounded degree graphs, distributed approximation algorithms |
| 2 | Saurav Pandit, Sriram V. Pemmaraju |
Rapid randomized pruning for fast greedy distributed algorithms.  |
PODC  |
2010 |
DBLP DOI BibTeX RDF |
distributed algorithms, randomized algorithms, greedy algorithms, facility location, primal-dual algorithms, minimum dominating set |
| 2 | Jukka Suomela |
Distributed algorithms for edge dominating sets.  |
PODC  |
2010 |
DBLP DOI BibTeX RDF |
port-numbered network, approximation, edge dominating set |
| 2 | Hany Samuel, Weihua Zhuang, Bruno R. Preiss |
DTN Based Dominating Set Routing for MANET in Heterogeneous Wireless Networking.  |
MONET  |
2009 |
DBLP DOI BibTeX RDF |
intermittent links, routing, mobile ad hoc network (MANET), delay tolerant network (DTN), user mobility |
| 2 | Jianxin Wang, Beiwei Chen, Qilong Feng, Jianer Chen |
An Efficient Fixed-Parameter Enumeration Algorithm for Weighted Edge Dominating Set.  |
FAW  |
2009 |
DBLP DOI BibTeX RDF |
|
| 2 | Geevarghese Philip, Venkatesh Raman, Somnath Sikdar |
Solving Dominating Set in Larger Classes of Graphs: FPT Algorithms and Polynomial Kernels.  |
ESA  |
2009 |
DBLP DOI BibTeX RDF |
|
| 2 | Daniel Lokshtanov, Matthias Mnich, Saket Saurabh |
Linear Kernel for Planar Connected Dominating Set.  |
TAMC  |
2009 |
DBLP DOI BibTeX RDF |
|
| 2 | Haïdar Safa, Wiaam Kassab |
Dominating set-based location management architecture for mobile IP networks.  |
Mobility Conference  |
2009 |
DBLP DOI BibTeX RDF |
packet delivery, mobility management, mobile IP, location update |
| 2 | Hans L. Bodlaender, Daniel Lokshtanov, Eelko Penninkx |
Planar Capacitated Dominating Set Is W[1]-Hard.  |
IWPEC  |
2009 |
DBLP DOI BibTeX RDF |
|
| 2 | A. Nagaraju, S. Ramachandram |
Adaptive partial dominating set algorithm for mobile ad-hoc networks.  |
Bangalore Compute Conf.  |
2009 |
DBLP DOI BibTeX RDF |
control information, route request, AODV |
| 2 | Feng Wang 0002, Erika Camacho, Kuai Xu |
Positive Influence Dominating Set in Online Social Networks.  |
COCOA  |
2009 |
DBLP DOI BibTeX RDF |
|
| 2 | Yonatan Cohen, Jaroslav Opatrny |
A local algorithm for dominating sets of quasi-unit disk graphs.  |
C3S2E  |
2009 |
DBLP DOI BibTeX RDF |
quasi-unit disk graph, tiling, ad-hoc wireless network, local algorithm, dominating set, geometric graph |
| 2 | Khac Tiep Mai, Dongkun Shin, Hyunseung Choo |
Connectivity-based clustering with stretching technique in MANETs.  |
ICUIMC  |
2009 |
DBLP DOI BibTeX RDF |
k-hop dominating set, multi-hop clustering, stretching clustering, ad hoc networks, mobility, stability |
| 2 | Fedor V. Fomin, Fabrizio Grandoni, Dieter Kratsch |
A measure & conquer approach for the analysis of exact algorithms.  |
J. ACM  |
2009 |
DBLP DOI BibTeX RDF |
Dominating set, exact algorithm, independent set |
| 2 | Xianyue Li, XiaoHua Xu, Feng Zou, Hongwei Du, Peng-Jun Wan, Yuexuan Wang, Weili Wu |
A PTAS for Node-Weighted Steiner Tree in Unit Disk Graphs.  |
COCOA  |
2009 |
DBLP DOI BibTeX RDF |
Node-weighted Steiner tree, minimum weighted connected dominating set, approximation algorithm, polynomial-time approximation scheme |
| 2 | Ding-Zhu Du |
Double Partition: (6+epsilon)-Approximation for Minimum Weight Dominating Set in Unit Disk Graphs.  |
AAIM  |
2008 |
DBLP DOI BibTeX RDF |
|
| 2 | Feng Zou, Xianyue Li, Donghyun Kim, Weili Wu |
Construction of Minimum Connected Dominating Set in 3-Dimensional Wireless Network.  |
WASA  |
2008 |
DBLP DOI BibTeX RDF |
|
| 2 | Donghyun Kim, Xianyue Li, Feng Zou, Zhao Zhang, Weili Wu |
Recyclable Connected Dominating Set for Large Scale Dynamic Wireless Networks.  |
WASA  |
2008 |
DBLP DOI BibTeX RDF |
|
| 2 | Avinash Srinivasan, Jie Wu |
TRACK: A Novel Connected Dominating Set based Sink Mobility Model for WSNs.  |
ICCCN  |
2008 |
DBLP DOI BibTeX RDF |
|
| 2 | Baljeet Malhotra, Mario A. Nascimento, Ioanis Nikolaidis |
Better tree - better fruits: using dominating set trees for MAX queries.  |
DMSN  |
2008 |
DBLP DOI BibTeX RDF |
MAX query, aggregate query processing, sensor networks, dominating sets |
| 2 | Kazuya Sakai, Fangyang Shen, Kyoung Min Kim, Min-Te Sun, Hiromi Okada |
Multi-Initiator Connected Dominating Set Construction for Mobile Ad Hoc Networks.  |
ICC  |
2008 |
DBLP DOI BibTeX RDF |
|
| 2 | Alireza Vahdatpour, Foad Dabiri, Maryam Moazeni, Majid Sarrafzadeh |
Theoretical Bound and Practical Analysis of Connected Dominating Set in Ad Hoc and Sensor Networks.  |
DISC  |
2008 |
DBLP DOI BibTeX RDF |
|
| 2 | Andreas Wiese, Evangelos Kranakis |
Local PTAS for Dominating and Connected Dominating Set in Location Aware Unit Disk Graphs.  |
WAOA  |
2008 |
DBLP DOI BibTeX RDF |
|
| 2 | Kai Xing, Wei Cheng, E. K. Park, Shmuel Rotenstreich |
Distributed Connected Dominating Set Construction in Geometric k-Disk Graphs.  |
ICDCS  |
2008 |
DBLP DOI BibTeX RDF |
|
| 2 | Ning Zhang, Incheol Shin, Feng Zou, Weili Wu, My T. Thai |
Trade-off scheme for fault tolerant connected dominating sets on size and diameter.  |
FOWANC  |
2008 |
DBLP DOI BibTeX RDF |
bounded diameter, fault tolerance, wireless ad-hoc networks, connected dominating set |
| 2 | L. He, K. Qiu, Z. Z. Shen |
Neighbourhood Broadcasting and Broadcasting on the (n, k)-Star Graph.  |
ICA3PP  |
2008 |
DBLP DOI BibTeX RDF |
neighbourhood broadcasting, (n and k)-star, disjoint cycle, broadcasting, dominating set, star |
| 2 | Johan M. M. van Rooij, Hans L. Bodlaender |
Exact Algorithms for Edge Domination.  |
IWPEC  |
2008 |
DBLP DOI BibTeX RDF |
minimum maximal matching, exponential time algorithms, measure and conquer, exact algorithms, edge dominating set |
| 2 | Paul S. Bonsma, Florian Zickfeld |
A 3/2-Approximation Algorithm for Finding Spanning Trees with Many Leaves in Cubic Graphs.  |
WG  |
2008 |
DBLP DOI BibTeX RDF |
maximum leaf, approximation algorithm, connected dominating set, cubic graph |
| 2 | Venkatesh Raman, Saket Saurabh |
Short Cycles Make W -hard Problems Hard: FPT Algorithms for W -hard Problems in Graphs with no Short Cycles.  |
Algorithmica  |
2008 |
DBLP DOI BibTeX RDF |
t-vertex cover, Dominating set, Set cover, Independent set, Parameterized complexity |
| 2 | Antoine Deza, Gabriel Indik |
A counterexample to the dominating set conjecture.  |
Optimization Letters  |
2007 |
DBLP DOI BibTeX RDF |
Dominating set conjecture, Metric polyhedra, Cut polyhedra |
| 2 | Pradip K. Srimani, Zhenyu Xu |
Self-Stabilizing Algorithms of Constructing Spanning Tree and Weakly Connected Minimal Dominating Set.  |
ICDCS Workshops  |
2007 |
DBLP DOI BibTeX RDF |
|
| 2 | Sayaka Kamei, Hirotsugu Kakugawa |
A Self-Stabilizing Distributed Approximation Algorithm for the Minimum Connected Dominating Set.  |
IPDPS  |
2007 |
DBLP DOI BibTeX RDF |
|
| 2 | Deniz Cokuslu, Kayhan Erciyes |
A Hierarchical Connected Dominating Set Based Clustering Algorithm for Mobile Ad Hoc Networks.  |
MASCOTS  |
2007 |
DBLP DOI BibTeX RDF |
|
| 2 | Chengdu Huang, Tarek F. Abdelzaher, Xue Liu |
On Dominating Set Allocation Policies in Real-Time Wide-Area Distributed Systems.  |
ECRTS  |
2007 |
DBLP DOI BibTeX RDF |
|
| 2 | Joachim Kneis, Daniel Mölle, Peter Rossmanith |
Partial vs. Complete Domination: t-Dominating Set.  |
SOFSEM  |
2007 |
DBLP DOI BibTeX RDF |
|
| 2 | Shankar M. Banik, Sridhar Radhakrishnan |
Minimizing broadcast latency in ad hoc wireless networks.  |
ACM Southeast Regional Conference  |
2007 |
DBLP DOI BibTeX RDF |
minimum connected dominating set, scheduling, broadcasting |
| 2 | Myung Ah Park, James Willson, Chen Wang, My T. Thai, Weili Wu, Andras Farago |
A dominating and absorbent set in a wireless ad-hoc network with different transmission ranges.  |
MobiHoc  |
2007 |
DBLP DOI BibTeX RDF |
absorbent set, disk graph, wireless ad-hoc network, dominating set |
| 2 | Mike Morgan, Vic Grout |
Metaheuristics for Wireless Network Optimisation.  |
AICT  |
2007 |
DBLP DOI BibTeX RDF |
wireless network design, minimum connected dominating set, simulated annealing, tabu search, metaheuristics |
| 2 | My T. Thai, Feng Wang 0002, Dan Liu, Shiwei Zhu, Ding-Zhu Du |
Connected Dominating Sets in Wireless Networks with Different Transmission Ranges.  |
IEEE Trans. Mob. Comput.  |
2007 |
DBLP DOI BibTeX RDF |
disk graph, wireless network, Connected dominating set, independent set, virtual backbone |
| 2 | Yingchi Mao, Zhuoming Xu, Yi Liang |
An Energy Efficient Connected Coverage Protocol in Wireless Sensor Networks.  |
APWeb/WAIM  |
2007 |
DBLP DOI BibTeX RDF |
Connected Coverage, Wireless Sensor Networks, Dominating Set |
| 2 | Vadim V. Lozin, Martin Milanic |
Tree-Width and Optimization in Bounded Degree Graphs.  |
WG  |
2007 |
DBLP DOI BibTeX RDF |
Hereditary class of graphs, Induced Matching, Dominating set, Tree-width |
| 2 | Jennie C. Hansen, Eric Schmutz, Li Sheng |
The Expected Size of the Rule k Dominating Set.  |
Algorithmica  |
2006 |
DBLP DOI BibTeX RDF |
|
| 2 | Károly Farkas, Florian Maurer, Lukas Ruf, Bernhard Plattner |
Dominating Set Based Support for Distributed Services in Mobile Ad Hoc Networks.  |
NOMS  |
2006 |
DBLP DOI BibTeX RDF |
|
| 2 | Ankur Jain, Sushanta Karmakar, Arobinda Gupta |
Adaptive Connected Dominating Set - An Exercise in Distributed Output Switching.  |
ICDCN  |
2006 |
DBLP DOI BibTeX RDF |
|
| 2 | Serge Gaspers, Mathieu Liedloff |
A Branch-and-Reduce Algorithm for Finding a Minimum Independent Dominating Set in Graphs.  |
WG  |
2006 |
DBLP DOI BibTeX RDF |
|
| 2 | Laxmi Gewali, Khursheed Mohamad, Min Tun |
Interference Aware Dominating Set for Sensor Network.  |
ITNG  |
2006 |
DBLP DOI BibTeX RDF |
|
| 2 | Deniz Cokuslu, Kayhan Erciyes, Orhan Dagdeviren |
A Dominating Set Based Clustering Algorithm for Mobile Ad Hoc Networks.  |
International Conference on Computational Science  |
2006 |
DBLP DOI BibTeX RDF |
|
| 2 | My T. Thai |
2-Connected Dominating Set inWireless Networks (Invited Talk Abstract).  |
SNPD  |
2006 |
DBLP DOI BibTeX RDF |
|
| 2 | Hirotsugu Kakugawa, Toshimitsu Masuzawa |
A self-stabilizing minimal dominating set algorithm with safe convergence.  |
IPDPS  |
2006 |
DBLP DOI BibTeX RDF |
|
| 2 | Henning Fernau |
edge dominating set: Efficient Enumeration-Based Exact Algorithms.  |
IWPEC  |
2006 |
DBLP DOI BibTeX RDF |
|
| 2 | Al-Sakib Khan Pathan, Choong Seon Hong |
A Key-Predistribution-Based Weakly Connected Dominating Set for Secure Clustering in DSN.  |
HPCC  |
2006 |
DBLP DOI BibTeX RDF |
|
| 2 | Serge Gaspers, Dieter Kratsch, Mathieu Liedloff |
Exponential Time Algorithms for the Minimum Dominating Set Problem on Some Graph Classes.  |
SWAT  |
2006 |
DBLP DOI BibTeX RDF |
|
| 2 | Jean Cardinal, Stefan Langerman, Eythan Levy |
Improved Approximation Bounds for Edge Dominating Set in Dense Graphs.  |
WAOA  |
2006 |
DBLP DOI BibTeX RDF |
|
| 2 | Frank K. H. A. Dehne, Michael R. Fellows, Henning Fernau, Elena Prieto, Frances A. Rosamond |
NONBLOCKER: Parameterized Algorithmics for minimum dominating set.  |
SOFSEM  |
2006 |
DBLP DOI BibTeX RDF |
|
| 2 | Chunmei Liu, Yinglei Song |
Exact Algorithms for Finding the Minimum Independent Dominating Set in Graphs.  |
ISAAC  |
2006 |
DBLP DOI BibTeX RDF |
|
| 2 | Fedor V. Fomin, Fabrizio Grandoni, Dieter Kratsch |
Solving Connected Dominating Set Faster Than 2n.  |
FSTTCS  |
2006 |
DBLP DOI BibTeX RDF |
|
| 2 | Yuanyuan Zeng, Xiaohua Jia, Yanxiang He |
Energy efficient distributed connected dominating sets construction in wireless sensor networks.  |
IWCMC  |
2006 |
DBLP DOI BibTeX RDF |
wireless sensor networks, approximation algorithm, energy efficient, connected dominating set |
| 2 | Stefan Funke, Alexander Kesselman, Ulrich Meyer, Michael Segal |
A simple improved distributed algorithm for minimum CDS in unit disk graphs.  |
TOSN  |
2006 |
DBLP DOI BibTeX RDF |
algorithms, Connected dominating set, unit disk graphs |
| 2 | Jie Wu, Wei Lou, Fei Dai |
Extended Multipoint Relays to Determine Connected Dominating Sets in MANETs.  |
IEEE Trans. Computers  |
2006 |
DBLP DOI BibTeX RDF |
heuristic solutions, multipoint relays (MPR), mobile ad hoc networks (MANETs), broadcasting, connected dominating set (CDS), Approximation ratio |
| 2 | Ding-Zhu Du, My T. Thai, Yingshu Li, Dan Liu, Shiwei Zhu |
Strongly Connected Dominating Sets in Wireless Sensor Networks with Unidirectional Links.  |
APWeb  |
2006 |
DBLP DOI BibTeX RDF |
Strongly Connected Dominating Set, Disk Graph, Wireless Sensor Network, Directed Graph, Virtual Backbone |
| 2 | Martin Farach-Colton, Rohan J. Fernandes, Miguel A. Mosteiro |
Lower Bounds for Clear Transmissions in Radio Networks.  |
LATIN  |
2006 |
DBLP DOI BibTeX RDF |
Station selection, Wake up, Weak Sensor Model, ACM-class: F.2.2, Sensor network, Ad-hoc network, Lower bound, Broadcast, Dominating set, Leader election, Radio network, Maximal independent set, Contention resolution, Random geometric graphs |
| 2 | Mathieu Couture, Michel Barbeau, Prosenjit Bose, Evangelos Kranakis |
Incremental Construction of k-Dominating Sets in Wireless Sensor Networks.  |
OPODIS  |
2006 |
DBLP DOI BibTeX RDF |
fault-tolerance, approximation algorithms, distributed algorithms, dominating set, unit disk graph, maximal independent set |
Displaying result #1 - #100 of 657 (100 per page; Change: ) Pages: [ 1][ 2][ 3][ 4][ 5][ 6][ 7][ >>] |
|