Computer Networks, ISSN 1389-1286, 03/2019, Volume 151, pp. 124 - 131

Owing to its dynamic topology with the lack of its central administration, the provisioning of quality of service (QoS) in case of the mobile ad hoc networks...

Mobile ad hoc networks (MANETs) | Ad-hoc on-demand multipath distance vector routing (AOMDV) | Quality of service (QoS) | Connected dominating set (CDS) | Load balancing | Stochastic diffusion search (SDS) | COMPUTER SCIENCE, HARDWARE & ARCHITECTURE | COMPUTER SCIENCE, INFORMATION SYSTEMS | TELECOMMUNICATIONS | ENGINEERING, ELECTRICAL & ELECTRONIC | SCHEME | ROUTING PROTOCOL | OPTIMIZATION ALGORITHM | MOBILE | Engineering schools | Algorithms | Residual energy | Mobile communication systems | Wireless networks | Quality of service | Quality of service architectures | Ad hoc networks | Topology | Protocol (computers) | Provisioning | Nodes

Mobile ad hoc networks (MANETs) | Ad-hoc on-demand multipath distance vector routing (AOMDV) | Quality of service (QoS) | Connected dominating set (CDS) | Load balancing | Stochastic diffusion search (SDS) | COMPUTER SCIENCE, HARDWARE & ARCHITECTURE | COMPUTER SCIENCE, INFORMATION SYSTEMS | TELECOMMUNICATIONS | ENGINEERING, ELECTRICAL & ELECTRONIC | SCHEME | ROUTING PROTOCOL | OPTIMIZATION ALGORITHM | MOBILE | Engineering schools | Algorithms | Residual energy | Mobile communication systems | Wireless networks | Quality of service | Quality of service architectures | Ad hoc networks | Topology | Protocol (computers) | Provisioning | Nodes

Journal Article

Journal of Combinatorial Optimization, ISSN 1382-6905, 11/2017, Volume 34, Issue 4, pp. 1060 - 1083

Let G be a connected graph and k be a positive integer. A vertex subset D of G is a k-hop connected dominating set if the subgraph of G induced by D is...

k -Hop connected dominating set | Convex and Discrete Geometry | Operations Research/Decision Theory | Approximation algorithms | Mathematics | Theory of Computation | Mathematical Modeling and Industrial Mathematics | k -Disruptive separator | Combinatorics | Hardness | Optimization | k-Disruptive separator | k-Hop connected dominating set | MATHEMATICS, APPLIED | PERMUTATION GRAPHS | LINEAR-TIME ALGORITHM | UNIT DISK GRAPHS | VERTEX COVER | WIRELESS AD HOC | kappa-Hop connected dominating set | STEINER TREES | DISTANCE-HEREDITARY GRAPHS | MINIMAL SEPARATORS | DISTRIBUTED CONSTRUCTION | COMPUTER SCIENCE, INTERDISCIPLINARY APPLICATIONS | kappa-Disruptive separator | CHORDAL GRAPHS | Mechanical properties | Algorithms

k -Hop connected dominating set | Convex and Discrete Geometry | Operations Research/Decision Theory | Approximation algorithms | Mathematics | Theory of Computation | Mathematical Modeling and Industrial Mathematics | k -Disruptive separator | Combinatorics | Hardness | Optimization | k-Disruptive separator | k-Hop connected dominating set | MATHEMATICS, APPLIED | PERMUTATION GRAPHS | LINEAR-TIME ALGORITHM | UNIT DISK GRAPHS | VERTEX COVER | WIRELESS AD HOC | kappa-Hop connected dominating set | STEINER TREES | DISTANCE-HEREDITARY GRAPHS | MINIMAL SEPARATORS | DISTRIBUTED CONSTRUCTION | COMPUTER SCIENCE, INTERDISCIPLINARY APPLICATIONS | kappa-Disruptive separator | CHORDAL GRAPHS | Mechanical properties | Algorithms

Journal Article

Information Processing Letters, ISSN 0020-0190, 07/2019, Volume 147, pp. 3 - 5

•It generalizes a result on optimal dominating sets of graphs to weighted graphs.•Optimal dominating sets (ODS) have many important applications.•The result...

k-Distance dominating set | Graph algorithms | Spanning tree | Weighted graph | COMPUTER SCIENCE, INFORMATION SYSTEMS

k-Distance dominating set | Graph algorithms | Spanning tree | Weighted graph | COMPUTER SCIENCE, INFORMATION SYSTEMS

Journal Article

Discrete Applied Mathematics, ISSN 0166-218X, 06/2012, Volume 160, Issue 9, pp. 1394 - 1398

A vertex subset of a graph is a dominating set if every vertex of the graph belongs to the set or has a neighbor in it. A connected dominating set is a...

Distance-hereditary graphs | Structural domination | Connected dominating sets | MATHEMATICS, APPLIED | TREES | Trees | Graphs | Mathematical models | Computation | Sun | Shortest-path problems

Distance-hereditary graphs | Structural domination | Connected dominating sets | MATHEMATICS, APPLIED | TREES | Trees | Graphs | Mathematical models | Computation | Sun | Shortest-path problems

Journal Article

Information Processing Letters, ISSN 0020-0190, 10/2014, Volume 114, Issue 10, pp. 551 - 555

We propose a fast, silent self-stabilizing protocol building a distance-k independent dominating set, named FID. The convergence of the protocol FID is...

Self-stabilization | Fault tolerance | Distance-k independent dominating set | Distance-k independent set | Distance-k dominating set | Distributed computing | ALGORITHM | COMPUTER SCIENCE, INFORMATION SYSTEMS | Networks | Data processing | Construction | Terminals | Computation | Convergence | Distributed, Parallel, and Cluster Computing | Networking and Internet Architecture | Computer Science

Self-stabilization | Fault tolerance | Distance-k independent dominating set | Distance-k independent set | Distance-k dominating set | Distributed computing | ALGORITHM | COMPUTER SCIENCE, INFORMATION SYSTEMS | Networks | Data processing | Construction | Terminals | Computation | Convergence | Distributed, Parallel, and Cluster Computing | Networking and Internet Architecture | Computer Science

Journal Article

Fixed Point Theory and Applications, ISSN 1687-1820, 12/2013, Volume 2013, Issue 1, pp. 1 - 16

Very recently, Haghi et al. (Topol. Appl. 160:450-454, 2013) proved that some fixed point theorems in partial metric spaces can be obtained from metric spaces....

altering distance function | Mathematical and Computational Biology | ordered metric space | Analysis | almost contraction | common fixed point | Mathematics, general | partial metric space | Mathematics | Applications of Mathematics | Topology | Differential Geometry | Ordered metric space | Almost contraction | Partial metric space | Altering distance function | Common fixed point | MATHEMATICS | NONLINEAR CONTRACTION | SETS | PSI | BERINDE | COINCIDENCE | Fixed point theory | Usage | Metric spaces | Contraction operators

altering distance function | Mathematical and Computational Biology | ordered metric space | Analysis | almost contraction | common fixed point | Mathematics, general | partial metric space | Mathematics | Applications of Mathematics | Topology | Differential Geometry | Ordered metric space | Almost contraction | Partial metric space | Altering distance function | Common fixed point | MATHEMATICS | NONLINEAR CONTRACTION | SETS | PSI | BERINDE | COINCIDENCE | Fixed point theory | Usage | Metric spaces | Contraction operators

Journal Article

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), ISSN 0302-9743, 2015, Volume 9466, pp. 354 - 366

Conference Proceeding

ACM Transactions on Database Systems (TODS), ISSN 0362-5915, 02/2016, Volume 40, Issue 4, pp. 1 - 38

Top - k dominating queries combine the natural idea of selecting the k best items with a comprehensive "goodness" criterion based on dominance. A point p 1...

Dominating queries | metric spaces | distance computation | Distance computation | Metric spaces | COMPUTER SCIENCE, SOFTWARE ENGINEERING | Algorithms | SIMILARITY SEARCH | COMPUTER SCIENCE, INFORMATION SYSTEMS | Performance | NEAREST-NEIGHBOR QUERIES | Usage | Query processing | Methods | Queries | Dynamic tests | Databases | Metric space | Mathematical analysis | Dominance | Vectors (mathematics)

Dominating queries | metric spaces | distance computation | Distance computation | Metric spaces | COMPUTER SCIENCE, SOFTWARE ENGINEERING | Algorithms | SIMILARITY SEARCH | COMPUTER SCIENCE, INFORMATION SYSTEMS | Performance | NEAREST-NEIGHBOR QUERIES | Usage | Query processing | Methods | Queries | Dynamic tests | Databases | Metric space | Mathematical analysis | Dominance | Vectors (mathematics)

Journal Article

Theoretical Computer Science, ISSN 0304-3975, 11/2012, Volume 459, pp. 89 - 99

Suppose G=(V,E) is a simple graph and k is a fixed positive integer. A subset D⊆V is a distancek-dominating set of G if for every u∈V, there exists a vertex...

Strongly chordal graph | APX-complete | Distance [formula omitted]-dominating set | Undirected path graph | NP-complete | Approximation algorithm | Distance [formula omitted]-paired-dominating set | Distance k-dominating set | Distance k-paired-dominating set | INTERVAL | NUMBERS | STRONGLY CHORDAL GRAPHS | ALGORITHMS | TREES | MATRICES | COMPUTER SCIENCE, THEORY & METHODS | Algorithms

Strongly chordal graph | APX-complete | Distance [formula omitted]-dominating set | Undirected path graph | NP-complete | Approximation algorithm | Distance [formula omitted]-paired-dominating set | Distance k-dominating set | Distance k-paired-dominating set | INTERVAL | NUMBERS | STRONGLY CHORDAL GRAPHS | ALGORITHMS | TREES | MATRICES | COMPUTER SCIENCE, THEORY & METHODS | Algorithms

Journal Article

Journal of Physics: Conference Series, ISSN 1742-6588, 05/2018, Volume 1022, Issue 1

Conference Proceeding

11.
Full Text
Simple linear-time algorithms for counting independent sets in distance-hereditary graphs

Discrete Applied Mathematics, ISSN 0166-218X, 04/2018, Volume 239, pp. 144 - 153

A connected graph is distance-hereditary if any two vertices have the same distance in all of its connected induced subgraphs. This paper proposes a unified...

Independent perfect dominating sets | Distance-hereditary graphs | Counting problem | Linear-time algorithms | Independent sets | Independent dominating sets | MATHEMATICS, APPLIED | NUMBER | COMPLEXITY | EFFICIENT DOMINATION PROBLEM | TREE

Independent perfect dominating sets | Distance-hereditary graphs | Counting problem | Linear-time algorithms | Independent sets | Independent dominating sets | MATHEMATICS, APPLIED | NUMBER | COMPLEXITY | EFFICIENT DOMINATION PROBLEM | TREE

Journal Article

Physical Review D - Particles, Fields, Gravitation and Cosmology, ISSN 1550-7998, 10/2014, Volume 90, Issue 8

We investigate the observational consequences of the early episodically dominating dark energy on the evolution of cosmological structures. For this aim, we...

BARYON ACOUSTIC-OSCILLATIONS | DISTANCE | PROBE | ASTRONOMY & ASTROPHYSICS | PHYSICS, PARTICLES & FIELDS | Physics - Cosmology and Nongalactic Astrophysics

BARYON ACOUSTIC-OSCILLATIONS | DISTANCE | PROBE | ASTRONOMY & ASTROPHYSICS | PHYSICS, PARTICLES & FIELDS | Physics - Cosmology and Nongalactic Astrophysics

Journal Article

Discussiones Mathematicae Graph Theory, ISSN 1234-3099, 05/2017, Volume 37, Issue 2, pp. 383 - 397

A set of vertices D of a graph G is a distance 2-dominating set of G if the distance between each vertex u ∊ (V (G) − D) and D is at most two. Let γ (G) denote...

universal fixer | distance 2 dominating set | prisms of graphs | Universal fixer | Prisms of graphs | Distance 2-dominating set | MATHEMATICS | distance 2-dominating set | UNIVERSAL FIXERS | Grafs, Teoria de | 05 Combinatorics | Teoria de grafs | 05C Graph theory | Matemàtiques i estadística | Matemàtica discreta | Graph theory | Classificació AMS | Àrees temàtiques de la UPC

universal fixer | distance 2 dominating set | prisms of graphs | Universal fixer | Prisms of graphs | Distance 2-dominating set | MATHEMATICS | distance 2-dominating set | UNIVERSAL FIXERS | Grafs, Teoria de | 05 Combinatorics | Teoria de grafs | 05C Graph theory | Matemàtiques i estadística | Matemàtica discreta | Graph theory | Classificació AMS | Àrees temàtiques de la UPC

Journal Article

PROCEEDINGS OF THE NATIONAL ACADEMY OF SCIENCES INDIA SECTION A-PHYSICAL SCIENCES, ISSN 0369-8203, 03/2020, Volume 90, Issue 1, pp. 141 - 147

The efficient k-distance domination number ckeoGTHORN is the minimum among the cardinalities of efficient k-distance dominating sets of G. Upper bound in terms...

Cayley/circulant graph | Distance domination | MULTIDISCIPLINARY SCIENCES | Efficient distance domination

Cayley/circulant graph | Distance domination | MULTIDISCIPLINARY SCIENCES | Efficient distance domination

Journal Article

Ars Combinatoria, ISSN 0381-7032, 07/2011, Volume 101, pp. 309 - 320

A monitor is a computer in the network which is able to detect a fault computer among its neighbors. There are two stages of monitoring fault computer: (1)...

Circulant networks | Liar dominating set | Locating-dominating set | Dominating set in graph theory | circulant networks | MATHEMATICS | liar dominating set | DISTANCE | CODES | SETS | locating-dominating set | GRAPHS

Circulant networks | Liar dominating set | Locating-dominating set | Dominating set in graph theory | circulant networks | MATHEMATICS | liar dominating set | DISTANCE | CODES | SETS | locating-dominating set | GRAPHS

Journal Article

Journal of Parallel and Distributed Computing, ISSN 0743-7315, 2003, Volume 63, Issue 4, pp. 481 - 487

A distance- k dominating set D of a directed graph G is a set of vertices such that for every vertex v of G, there is a vertex u∈ D and the distance between u...

Distance- k dominating set | Directed split-stars | Distributed algorithms | Interconnection networks | Distance-k dominating set | distributed algorithms | COMPUTER SCIENCE, THEORY & METHODS | directed split-stars | distance-k dominating set | interconnection networks | BONDAGE NUMBER | GRAPHS

Distance- k dominating set | Directed split-stars | Distributed algorithms | Interconnection networks | Distance-k dominating set | distributed algorithms | COMPUTER SCIENCE, THEORY & METHODS | directed split-stars | distance-k dominating set | interconnection networks | BONDAGE NUMBER | GRAPHS

Journal Article

Ad Hoc Networks, ISSN 1570-8705, 2007, Volume 5, Issue 4, pp. 504 - 530

We present a clustering technique addressing redundancy for bounded-distance clusters, which means being able to determine the minimum number of cluster-heads...

Domination in graphs | ( k, r)-dominating sets | Multi-core multicast protocols | Multicast protocols | Ad hoc networks | Multiple domination | Clustering | Distance domination | (k, r)-dominating sets | (k,r)-dominating sets | COMPUTER SCIENCE, INFORMATION SYSTEMS | ENERGY-EFFICIENT | TELECOMMUNICATIONS | Algorithms

Domination in graphs | ( k, r)-dominating sets | Multi-core multicast protocols | Multicast protocols | Ad hoc networks | Multiple domination | Clustering | Distance domination | (k, r)-dominating sets | (k,r)-dominating sets | COMPUTER SCIENCE, INFORMATION SYSTEMS | ENERGY-EFFICIENT | TELECOMMUNICATIONS | Algorithms

Journal Article

International Journal of Mathematical Combinatorics, ISSN 1937-1055, 10/2007, Volume 1, p. 94

Let G be a connected graph of order n, and NC2(G) denote min {|N(u)∪N(v)| : dist(u, v) = 2}, where dist(u, v) is the distance between u and v in G. A cycle C...

Graphs

Graphs

Journal Article

Frontiers of Mathematics in China, ISSN 1673-3452, 4/2017, Volume 12, Issue 2, pp. 339 - 357

Let G = (V,A) be a digraph and k ≥ 1 an integer. For u, v ∈ V, we say that the vertex u distance k-dominate v if the distance from u to v at most k. A set D of...

distance dominating set | 05C20 | generalized Kautz digraph | Mathematics, general | Combinatorial problems | Mathematics | generalized de Bruijn digraph | 05C69 | dominating set | MATHEMATICS | NUMBER | CYCLES | TWIN DOMINATION | GRAPHS | Integers | Networks | Graph theory | Interconnection | Mathematical analysis

distance dominating set | 05C20 | generalized Kautz digraph | Mathematics, general | Combinatorial problems | Mathematics | generalized de Bruijn digraph | 05C69 | dominating set | MATHEMATICS | NUMBER | CYCLES | TWIN DOMINATION | GRAPHS | Integers | Networks | Graph theory | Interconnection | Mathematical analysis

Journal Article

Transactions on Combinatorics, ISSN 2251-8657, 09/2016, Volume 5, Issue 3, pp. 1 - 9

A set $S$ of vertices in a graph $G=(V,E)$ is called a total$k$-distance dominating set if every vertex in $V$ is withindistance $k$ of a vertex in $S$. A...

total $k$-distance dominating set | total $k$-distance domination-critical | Distance domination

total $k$-distance dominating set | total $k$-distance domination-critical | Distance domination

Journal Article

No results were found for your search.

Cannot display more than 1000 results, please narrow the terms of your search.