Results 221 to 230 of about 208,933 (266)
Reliable resting-state EEG connectivity measures reveal brain network destabilization and cognitive decoupling following prolonged extreme working conditions. [PDF]
Cogn NeurodynÇelik S, Aydın S.
europepmc +1 more source
Some of the next articles are maybe not open access.
Related searches:
Related searches:
SIAM Journal on Discrete Mathematics, 1999
A property \(P\) of graphs is called monotone if it is preserved under the deletion of edges. Let \(\Delta^P_n\) denote the simplicial complex whose simplices are edge sets of \(n\)-vertex graphs having a monotone property \(P\). Topological properties of complexes of undirected graphs recently have been studied in a number of papers (see references in
Anders Björner, Volkmar Welker
openaire +1 more source
A property \(P\) of graphs is called monotone if it is preserved under the deletion of edges. Let \(\Delta^P_n\) denote the simplicial complex whose simplices are edge sets of \(n\)-vertex graphs having a monotone property \(P\). Topological properties of complexes of undirected graphs recently have been studied in a number of papers (see references in
Anders Björner, Volkmar Welker
openaire +1 more source
SIAM Journal on Discrete Mathematics, 1999
A ranking of a (di)graph is a colouring of the vertex set with positive integers in such a way that every (di)path between two vertices of the same colour has a vertex of larger colour. The \(k\)-ranking problem is as follows: given a (di)graph \(G\) and an integer \(k\), check whether \(G\) has a ranking with \(k\) colours. This problem is known to be
Jan Kratochvíl, Zsolt Tuza
openaire +2 more sources
A ranking of a (di)graph is a colouring of the vertex set with positive integers in such a way that every (di)path between two vertices of the same colour has a vertex of larger colour. The \(k\)-ranking problem is as follows: given a (di)graph \(G\) and an integer \(k\), check whether \(G\) has a ranking with \(k\) colours. This problem is known to be
Jan Kratochvíl, Zsolt Tuza
openaire +2 more sources
Journal of Graph Theory, 1992
AbstractWe give a new condition involving degrees sufficient for a digraph to be hamiltonian.
openaire +2 more sources
AbstractWe give a new condition involving degrees sufficient for a digraph to be hamiltonian.
openaire +2 more sources
Independent Directed Triangles in a Directed Graph
Graphs and Combinatorics, 2000zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire +2 more sources
Software: Practice and Experience, 1987
AbstractA general‐purpose browser for directed graphs is described. The browser provides operations to examine and edit graphs and to generate a layout for a graph automatically that minimizes edge crossings. Two layout algorithms were implemented. A hierarchical graph layout algorithm was found to be best for directed graphs.
Lawrence A. Rowe +5 more
openaire +1 more source
AbstractA general‐purpose browser for directed graphs is described. The browser provides operations to examine and edit graphs and to generate a layout for a graph automatically that minimizes edge crossings. Two layout algorithms were implemented. A hierarchical graph layout algorithm was found to be best for directed graphs.
Lawrence A. Rowe +5 more
openaire +1 more source
Networks, 2008
AbstractThe concept of persistent directed graphs was introduced by Hendrickx et al. to help analyze the stability of autonomous agent systems. They provided a combinatorial characterization for persistence but the complexity of testing persistence remained open.
Jørgen Bang-Jensen, Tibor Jordán
openaire +1 more source
AbstractThe concept of persistent directed graphs was introduced by Hendrickx et al. to help analyze the stability of autonomous agent systems. They provided a combinatorial characterization for persistence but the complexity of testing persistence remained open.
Jørgen Bang-Jensen, Tibor Jordán
openaire +1 more source