Results 41 to 50 of about 358,315 (287)
, 2015 We introduce a new graph parameter called the burning number, inspired by contact processes on graphs such as graph bootstrap percolation, and graph searching paradigms such as Firefighter. The burning number measures the speed of the spread of contagion
Bonato, Anthony +2 more
core +1 more source
Transactions on Networks and Communications, 2017 To determine that two given undirected graphs are isomorphic, we construct for them auxiliary graphs, using the breadth-first search. This makes capability to position vertices in each digraph with respect to each other. If the given graphs are isomorphic, in each of them we can find such positionally equivalent auxiliary digraphs that have the same ...
openaire +3 more sources
Queue, 2020 Welcome to Drill Bits , a new column about programming. This inaugural episode shows how graph search algorithms can avoid unnecessary work. A simple modification to classic breadth-first search improves the lower bound on its running time: Whereas classic BFS always requires time proportional to the number of ...
openaire +1 more source
BMC Bioinformatics, 2017 Background Transcription factors (TFs) form a complex regulatory network within the cell that is crucial to cell functioning and human health. While methods to establish where a TF binds to DNA are well established, these methods provide no information ...
Maxwell Spadafore +2 more
doaj +1 more source
Method for searching higher symmetries for quad graph equations
, 2011 Generalized symmetry integrability test for discrete equations on the square lattice is studied. Integrability conditions are discussed. A method for searching higher symmetries (including non-autonomous ones) for quad graph equations is suggested based ...
Garifullin, Rustem N. +2 more
core +1 more source
Adversarial Learned Molecular Graph Inference and Generation
, 2020 Recent methods for generating novel molecules use graph representations of molecules and employ various forms of graph convolutional neural networks for inference.
Pölsterl, Sebastian +1 more
core +1 more source
Search for deep graph neural networks
Information Sciences, 2023 Current GNN-oriented NAS methods focus on the search for different layer aggregate components with shallow and simple architectures, which are limited by the 'over-smooth' problem. To further explore the benefits from structural diversity and depth of GNN architectures, we propose a GNN generation pipeline with a novel two-stage search space, which ...
Guosheng Feng +2 more
openaire +2 more sources
Efficient keyword spotting system for information retrieval
Tongxin xuebao, 2006 A new two-stage keyword spotting system was proposed based on syllable graph for audio information retrieval task,which could efficiently spot the interesting words in mass speech data,thus serve for the national security.It comprised two stages ...
LUO Jun, OU Zhi-jian
doaj +2 more sources
Connected and internal graph searching [PDF]
, 2002 This paper is concerned with the graph searching game. The search number es(G) of a graph G is the smallest number of searchers required to clear G. A search strategy is monotone (m) if no recontamination ever occurs.
Barrière Figueroa, Eulalia +3 more
core +1 more source
Connected graph searching in chordal graphs
Discrete Applied Mathematics, 2009 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire +1 more source