dominate_greedy_matrix: Finding the approximately minimum dominating set of graph...
In Artur-man/PCDSL: Proximity Catch Digraphs: Statistical Learning
dominate_greedy_matrix R Documentation
Finding the approximately minimum dominating set of graph given its adjacency matrix
with the greedy algorithm
Description
Finding the approximately minimum dominating set of graph given its adjacency matrix
with the greedy algorithm
Usage
dominate_greedy_matrix(A)
Arguments
A
The adjacency matrix
Value
S A subset (the approximate minimum dominating set) of the vertex set of the graph given the adjacency matrix A
Artur-man/PCDSL documentation built on Feb. 24, 2024, 11:15 p.m.
R Package Documentation
Browse R Packages
We want your feedback!
Note that we can't provide technical support on individual packages. You should contact the package authors for that.
| dominate_greedy_matrix | R Documentation |
Finding the approximately minimum dominating set of graph given its adjacency matrix with the greedy algorithm
Description
Finding the approximately minimum dominating set of graph given its adjacency matrix with the greedy algorithm
Usage
dominate_greedy_matrix(A)
Arguments
A |
The adjacency matrix |
Value
S A subset (the approximate minimum dominating set) of the vertex set of the graph given the adjacency matrix A
R Package Documentation
Browse R Packages
We want your feedback!
Note that we can't provide technical support on individual packages. You should contact the package authors for that.
Embedding an R snippet on your website
Add the following code to your website.
For more information on customizing the embed code, read Embedding Snippets.