Results 41 to 50 of about 5,057 (262)

Mining Topological Dependencies of Recurrent Congestion in Road Networks

ISPRS International Journal of Geo-Information, 2021
The discovery of spatio-temporal dependencies within urban road networks that cause Recurrent Congestion (RC) patterns is crucial for numerous real-world applications, including urban planning and the scheduling of public transportation services.
Nicolas Tempelmeier, Udo Feuerhake, Oskar Wage, Elena Demidova   +3 more
doaj   +1 more source

Motif-role-fingerprints: the building-blocks of motifs, clustering-coefficients and transitivities in directed networks. [PDF]

PLoS ONE, 2014
Complex networks are frequently characterized by metrics for which particular subgraphs are counted. One statistic from this category, which we refer to as motif-role fingerprints, differs from global subgraph counts in that the number of subgraphs in ...
Mark D McDonnell, Ömer Nebil Yaveroğlu, Brett A Schmerl, Nicolangelo Iannella, Nicolangelo Iannella, Lawrence M Ward   +5 more
doaj   +1 more source

The Largest Subgraph Without A Forbidden Induced Subgraph

Combinatorica
20 ...
Jacob Fox, Rajko Nenadov, Huy Tuan Pham
openaire   +2 more sources

The parameterised complexity of counting even and odd induced subgraphs [PDF]

, 2016
We consider the problem of counting, in a given graph, the number of induced k-vertex subgraphs which have an even number of edges, and also the complementary problem of counting the k-vertex induced subgraphs having an odd number of edges.
Meeks, K, Meeks, Kitty, Jerrum, M, Jerrum, Mark   +3 more
core   +1 more source

A novel method for assessing and measuring homophily in networks through second-order statistics

Scientific Reports, 2022
We present a new method for assessing and measuring homophily in networks whose nodes have categorical attributes, namely when the nodes of networks come partitioned into classes (colors).
Nicola Apollonio, Paolo G. Franciosa, Daniele Santoni   +2 more
doaj   +1 more source

Apex Graphs and Cographs

Theory and Applications of Graphs
A class G of graphs is called hereditary if it is closed under taking induced subgraphs. We denote by G^{apex} the class of graphs G that contain a vertex v such that G − v is in G.
Jagdeep Singh, Vaidy Sivaraman, Thomas Zaslavsky   +2 more
doaj   +1 more source

Induced subgraphs of Johnson graphs [PDF]

Involve, a Journal of Mathematics, 2012
12 pages, 4 ...
Naimi, Ramin, Shaw, Jeffrey
openaire   +3 more sources

Efficient orbit-aware triad and quad census in directed and undirected graphs

Applied Network Science, 2017
The prevalence of select substructures is an indicator of network effects in applications such as social network analysis and systems biology. Moreover, subgraph statistics are pervasive in stochastic network models, and they need to be assessed ...
Mark Ortmann, Ulrik Brandes
doaj   +1 more source

Listing Induced Steiner Subgraphs as a Compact Way to Discover Steiner Trees in Graphs [PDF]

, 2019
This paper investigates induced Steiner subgraphs as a variant of the classical Steiner trees, so as to compactly represent the (exponentially many) Steiner trees sharing the same underlying induced subgraph.
Conte, Alessio, Grossi R., Kanté, Mamadou,, Uno, Takeaki, Uno T., Grossi, Roberto, Wasa, Kunihiro, Kanté, Mamadou Moustapha, Kante M. M., Wasa K., Kanté, Mamadou, Moustapha, Conte A., Marino, Andrea, Marino A.   +13 more
core   +1 more source

Induced subgraphs of prescribed size [PDF]

Journal of Graph Theory, 2003
AbstractA subgraph of a graph G is called trivial if it is either a clique or an independent set. Let q(G) denote the maximum number of vertices in a trivial subgraph of G. Motivated by an open problem of Erdős and McKay we show that every graph G on n vertices for which q(G)≤ C log n contains an induced subgraph with exactly y edges, for every y ...
Noga Alon, Michael Krivelevich, Benny Sudakov   +2 more
openaire   +2 more sources