Name
Abstract | ||
|---|---|---|
We consider an iterative irreversible process on graphs. Starting with some initial set S of vertices of a given graph G, this process iteratively adds to S all vertices u of G outside of S for which the intersection of the current set S with the neighborhood NG(u) of u in G belongs to a collection τ(u) of subsets of NG(u) given for each vertex u. |
Year | DOI | Venue |
|---|---|---|
2017 | 10.1016/j.tcs.2017.05.010 | Theoretical Computer Science |
Keywords | Field | DocType |
Irreversible threshold processes,Target set,Dynamic monopoly | Discrete mathematics,Combinatorics,Convexity,Vertex (geometry),Bound graph,Upper and lower bounds,Hull number,Independent set,Probabilistic logic,Time complexity,Mathematics | Journal |
Volume | Issue | ISSN |
689 | C | 0304-3975 |
Citations | PageRank | References |
0 | 0.34 | 16 |
Authors | ||
4 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Carlos Vinícius G. C. Lima | 1 | 15 | 4.40 |
| Dieter Rautenbach | 2 | 946 | 138.87 |
| Uéverton S. Souza | 3 | 20 | 21.12 |
| Jayme Luiz Szwarcfiter | 4 | 618 | 95.79 |