Found: 40
Select item for more details and to access through your institution.
Lazy Cops and Robbers on Hypercubes.
- Published in:
- Combinatorics, Probability & Computing, 2015, v. 24, n. 6, p. 829, doi. 10.1017/S0963548314000807
- By:
- Publication type:
- Article
An Alternative Proof of the Linearity of the Size-Ramsey Number of Paths.
- Published in:
- Combinatorics, Probability & Computing, 2015, v. 24, n. 3, p. 551, doi. 10.1017/S096354831400056X
- By:
- Publication type:
- Article
Revolutionaries and Spies on Random Graphs.
- Published in:
- Combinatorics, Probability & Computing, 2013, v. 22, n. 3, p. 417, doi. 10.1017/S0963548313000072
- By:
- Publication type:
- Article
Modular Orientations of Random and Quasi-Random Regular Graphs.
- Published in:
- Combinatorics, Probability & Computing, 2011, v. 20, n. 3, p. 321, doi. 10.1017/S0963548310000544
- By:
- Publication type:
- Article
Performance of community detection algorithms supported by node embeddings.
- Published in:
- Journal of Complex Networks, 2024, v. 12, n. 4, p. 1, doi. 10.1093/comnet/cnae035
- By:
- Publication type:
- Article
Unsupervised framework for evaluating and explaining structural node embeddings of graphs.
- Published in:
- Journal of Complex Networks, 2024, v. 12, n. 2, p. 1, doi. 10.1093/comnet/cnae003
- By:
- Publication type:
- Article
Hypergraph Artificial Benchmark for Community Detection (h–ABCD).
- Published in:
- Journal of Complex Networks, 2023, v. 11, n. 4, p. 1, doi. 10.1093/comnet/cnad028
- By:
- Publication type:
- Article
Modularity of the ABCD random graph model with community structure.
- Published in:
- Journal of Complex Networks, 2022, v. 10, n. 6, p. 1, doi. 10.1093/comnet/cnac050
- By:
- Publication type:
- Article
Evaluating node embeddings of complex networks.
- Published in:
- Journal of Complex Networks, 2022, v. 10, n. 4, p. 1, doi. 10.1093/comnet/cnac030
- By:
- Publication type:
- Article
An unsupervised framework for comparing graph embeddings.
- Published in:
- Journal of Complex Networks, 2020, v. 8, n. 5, p. 1, doi. 10.1093/comnet/cnz043
- By:
- Publication type:
- Article
Local clustering coefficient of spatial preferential attachment model.
- Published in:
- Journal of Complex Networks, 2020, v. 8, n. 1, p. N.PAG, doi. 10.1093/comnet/cnz019
- By:
- Publication type:
- Article
Dimensionality of Social Networks Using Motifs and Eigenvalues.
- Published in:
- PLoS ONE, 2014, v. 9, n. 9, p. 1, doi. 10.1371/journal.pone.0106052
- By:
- Publication type:
- Article
Multiagent Routing Simulation with Partial Smart Vehicles Penetration.
- Published in:
- Journal of Advanced Transportation, 2020, p. 1, doi. 10.1155/2020/3152020
- By:
- Publication type:
- Article
Meyniel's conjecture holds for random d‐regular graphs.
- Published in:
- Random Structures & Algorithms, 2019, v. 55, n. 3, p. 719, doi. 10.1002/rsa.20874
- By:
- Publication type:
- Article
Clique coloring of binomial random graphs.
- Published in:
- Random Structures & Algorithms, 2019, v. 54, n. 4, p. 589, doi. 10.1002/rsa.20804
- By:
- Publication type:
- Article
Perfect matchings and Hamiltonian cycles in the preferential attachment model.
- Published in:
- Random Structures & Algorithms, 2019, v. 54, n. 2, p. 258, doi. 10.1002/rsa.20778
- By:
- Publication type:
- Article
Rainbow perfect matchings and Hamilton cycles in the random geometric graph.
- Published in:
- Random Structures & Algorithms, 2017, v. 51, n. 4, p. 587, doi. 10.1002/rsa.20717
- By:
- Publication type:
- Article
Meyniel's conjecture holds for random graphs.
- Published in:
- Random Structures & Algorithms, 2016, v. 48, n. 2, p. 396, doi. 10.1002/rsa.20587
- By:
- Publication type:
- Article
Scale-free graphs of increasing degree.
- Published in:
- Random Structures & Algorithms, 2011, v. 38, n. 4, p. 396, doi. 10.1002/rsa.20318
- By:
- Publication type:
- Article
Chasing robbers on random graphs: Zigzag theorem.
- Published in:
- Random Structures & Algorithms, 2010, v. 37, n. 4, p. 516, doi. 10.1002/rsa.20338
- By:
- Publication type:
- Article
Artificial benchmark for community detection with outliers (ABCD+o).
- Published in:
- Applied Network Science, 2023, v. 8, n. 1, p. 1, doi. 10.1007/s41109-023-00552-9
- By:
- Publication type:
- Article
Graphs with the n-e.c. adjacency property constructed from resolvable designs.
- Published in:
- Journal of Combinatorial Designs, 2009, v. 17, n. 4, p. 294, doi. 10.1002/jcd.20210
- By:
- Publication type:
- Article
Clustering via hypergraph modularity.
- Published in:
- PLoS ONE, 2019, v. 14, n. 11, p. 1, doi. 10.1371/journal.pone.0224307
- By:
- Publication type:
- Article
investigating the Properties of a social Bookmarking and tagging Network.
- Published in:
- International Journal of Data Warehousing & Mining, 2010, v. 6, n. 1, p. 1, doi. 10.4018/jdwm.2010090801
- By:
- Publication type:
- Article
The Game of Overprescribed Cops and Robbers Played on Graphs.
- Published in:
- Graphs & Combinatorics, 2017, v. 33, n. 4, p. 801, doi. 10.1007/s00373-017-1815-2
- By:
- Publication type:
- Article
Burning Graphs: A Probabilistic Perspective.
- Published in:
- Graphs & Combinatorics, 2017, v. 33, n. 2, p. 449, doi. 10.1007/s00373-017-1768-5
- By:
- Publication type:
- Article
Graphs with Average Degree Smaller Than $${\frac {30}{11}}$$ Burn Slowly.
- Published in:
- Graphs & Combinatorics, 2014, v. 30, n. 2, p. 455, doi. 10.1007/s00373-012-1265-9
- By:
- Publication type:
- Article
Cleaning Random d-Regular Graphs with Brooms.
- Published in:
- Graphs & Combinatorics, 2011, v. 27, n. 4, p. 567, doi. 10.1007/s00373-010-0986-x
- By:
- Publication type:
- Article
Cleaning with Brooms.
- Published in:
- Graphs & Combinatorics, 2011, v. 27, n. 2, p. 251, doi. 10.1007/s00373-010-0965-2
- By:
- Publication type:
- Article
Detecting bots in social-networks using node and structural embeddings.
- Published in:
- Journal of Big Data, 2023, v. 10, n. 1, p. 1, doi. 10.1186/s40537-023-00796-3
- By:
- Publication type:
- Article
A variant of the Erdős–Rényi random graph process.
- Published in:
- Journal of Graph Theory, 2023, v. 102, n. 2, p. 322, doi. 10.1002/jgt.22873
- By:
- Publication type:
- Article
Almost all 5‐regular graphs have a 3‐flow.
- Published in:
- Journal of Graph Theory, 2020, v. 93, n. 2, p. 147, doi. 10.1002/jgt.22478
- By:
- Publication type:
- Article
Rainbow Arborescence in Random Digraphs.
- Published in:
- Journal of Graph Theory, 2016, v. 83, n. 3, p. 251, doi. 10.1002/jgt.21995
- By:
- Publication type:
- Article
Geodesics and almost geodesic cycles in random regular graphs.
- Published in:
- Journal of Graph Theory, 2011, v. 66, n. 2, p. 115, doi. 10.1002/jgt.20496
- By:
- Publication type:
- Article
Empirical Models of Social Learning in a Large, Evolving Network.
- Published in:
- PLoS ONE, 2016, v. 11, n. 10, p. 1, doi. 10.1371/journal.pone.0160307
- By:
- Publication type:
- Article
Vehicle Routing Simulation for Prediction of Commuter's Behaviour.
- Published in:
- Journal of Advanced Transportation, 2022, p. 1, doi. 10.1155/2022/1604303
- By:
- Publication type:
- Article
A multi-purposed unsupervised framework for comparing embeddings of undirected and directed graphs.
- Published in:
- Network Science, 2022, v. 10, n. 4, p. 323, doi. 10.1017/nws.2022.27
- By:
- Publication type:
- Article
Artificial Benchmark for Community Detection (ABCD)--Fast random graph model with community structure.
- Published in:
- Network Science, 2021, v. 9, n. 2, p. 153, doi. 10.1017/nws.2020.45
- By:
- Publication type:
- Article
THE TOTAL ACQUISITION NUMBER OF THE RANDOMLY WEIGHTED PATH.
- Published in:
- Discussiones Mathematicae: Graph Theory, 2017, v. 37, n. 4, p. 919, doi. 10.7151/dmgt.1972
- By:
- Publication type:
- Article
THE FIRST PLAYER WINS THE ONE-COLOUR TRIANGLE AVOIDANCE GAME ON 16 VERTICES.
- Published in:
- Discussiones Mathematicae: Graph Theory, 2012, v. 32, n. 1, p. 181, doi. 10.7151/dmgt.1596
- By:
- Publication type:
- Article