Results 11 to 20 of about 121,460 (194)
Countable ultrahomogeneous undirected graphs [PDF]
Transactions of the American Mathematical Society, 1980 Let G = ⟨ V G , E G ⟩ G\, = \,\left \langle {{V_G},\,{E_G}} \right \rangle be an ...
Lachlan, A. H., Woodrow, Robert E.
openaire +1 more source
Time varying undirected graphs [PDF]
Machine Learning, 2010 Undirected graphs are often used to describe high dimensional distributions. Under sparsity conditions, the graph can be estimated using ℓ1 penalization methods. However, current methods assume that the data are independent and identically distributed. If the distribution, and hence the graph, evolves over time then the data are not longer identically ...
Zhou, Shuheng +2 more
openaire +4 more sources
PageRank in undirected random graphs [PDF]
Internet Mathematics, 2015 PageRank has numerous applications in information retrieval, reputation systems, machine learning, and graph partitioning. In this paper, we study PageRank in undirected random graphs with an expansion property. The Chung-Lu random graph is an example of such a graph.
Avrachenkov, Konstantin +3 more
openaire +6 more sources
On automorphisms of undirected Bruhat graphs
Mathematische Zeitschrift, 2023 v2: Minor edits and updated ...
Gaetz, Christian, Gao, Yibo
openaire +3 more sources
Structure of Projective Planar Subgraphs of the Graph Obstructions for Fixed Surface
Кібернетика та комп'ютерні технології, 2022 Consider the problem of studying the metric properties of a subgraph G \ v, where v is an arbitrary vertex of obstruction graphs G of a nonorientable genus, which will determine the sets of points of attachment of one subgraph to another and allow ...
Volodymyr Petrenjuk +2 more
doaj +1 more source
A family of mixed graphs with large order and diameter 2 [PDF]
, 2017 A mixed regular graph is a connected simple graph in which each vertex has both a fixed outdegree (the same indegree) and a fixed undirected degree.
Araujo Pardo, Gabriela +3 more
core +2 more sources
Replacement Paths via Row Minima of Concise Matrices [PDF]
, 2013 Matrix $M$ is {\em $k$-concise} if the finite entries of each column of $M$ consist of $k$ or less intervals of identical numbers. We give an $O(n+m)$-time algorithm to compute the row minima of any $O(1)$-concise $n\times m$ matrix. Our algorithm yields
Lee, Cheng-Wei, Lu, Hsueh-I
core +1 more source
Parity games on undirected graphs [PDF]
Information Processing Letters, 2012 We examine the complexity of solving parity games in the special case when the underlying game graph is undirected. For strictly alternating games, that is, when the game graph is bipartite between the nodes of the two players, we observe that the solution can be computed in linear time. In contrast, when the assumption of strict alternation is dropped,
Berwanger, Dietmar, Serre, Olivier
openaire +3 more sources
Lucas Graceful Labeling for Some Graphs [PDF]
, 2011 By a graph, we mean a finite undirected graph without loops or multiple ...
Nagarajan, A. +2 more
core +1 more source
EURASIP Journal on Audio, Speech, and Music Processing, 2023 The paper uses the K-graphs learning method to construct weighted, connected, undirected multiple graphs, aiming to reveal intrinsic relationships of speech samples in the inter-frame and intra-frame. To benefit from the learned multiple graphs’ property
Tingting Wang +4 more
doaj +1 more source