Results 31 to 40 of about 22,888 (290)
Recognizing weighted directed cartesian graph bundles
Discussiones Mathematicae Graph Theory, 2000 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Zmazek, Blaž, Žerovnik, Janez
openaire +4 more sources
Regularity-based spectral clustering and mapping the Fiedler-carpet
Special Matrices, 2022 We discuss spectral clustering from a variety of perspectives that include extending techniques to rectangular arrays, considering the problem of discrepancy minimization, and applying the methods to directed graphs. Near-optimal clusters can be obtained
Bolla Marianna +4 more
doaj +1 more source
Systems, 2023 We introduce resource allocation techniques for problems where (i) the agents express requests for obtaining item bundles as compact edge-weighted directed acyclic graphs (each path in such a graph is a bundle whose valuation is the sum of the weights of
Stéphanie Roussel +3 more
doaj +1 more source
Minimum 2SAT-DELETION: inapproximability results and relations to Minimum Vertex Cover [PDF]
, 2007 The MINIMUM 2SAT-DELETION problem is to delete the minimum number of clauses in a 2SAT instance to make it satisfiable. It is one of the prototypes in the approximability hierarchy of minimization problems Khanna et al.
Chlebikova, Janka +5 more
core +1 more source
Weight-discounted Symmetrization in Clustering Directed Graphs
Proceedings of the 2012 2nd International Conference on Computer and Information Applications (ICCIA 2012), 2012 An increasing attention has been recently devoted to uncovering community structure in directed graphs which widely exist in real-world complex networks such as social networks, citation networks, World Wide Web, email networks, etc. A two-stage framework for detecting clusters is an effective way for clustering directed graphs while the first stage is
Bin He +3 more
openaire +1 more source
On The Determinant of q-Distance Matrix of a Graph
Discussiones Mathematicae Graph Theory, 2014 In this note, we show how the determinant of the q-distance matrix Dq(T) of a weighted directed graph G can be expressed in terms of the corresponding determinants for the blocks of G, and thus generalize the results obtained by Graham et al.
Li Hong-Hai, Su Li, Zhang Jing
doaj +1 more source
Iranian Journal of Psychiatry, 2021 Objective: This study aimed to investigate differences in brain networks between healthy children and children with attention deficit hyperactivity disorder (ADHD) during an attention test.
Ali Ekhlasi +2 more
doaj +1 more source
Edge-weighting of gene expression graphs [PDF]
, 2009 In recent years, considerable research efforts have been directed to micro-array technologies and their role in providing simultaneous information on expression profiles for thousands of genes.
Kerr, Gráinne +8 more
core +1 more source
REGULAR PATTERN MINING (WITH JITTER) ON WEIGHTED-DIRECTED DYNAMIC GRAPHS [PDF]
Journal of Engineering Science and Technology, 2017 Real world graphs are mostly dynamic in nature, exhibiting time-varying behaviour in structure of the graph, weight on the edges and direction of the edges.
A. GUPTA +3 more
doaj
Ollivier Ricci curvature of directed hypergraphs
Scientific Reports, 2020 Many empirical networks incorporate higher order relations between elements and therefore are naturally modelled as, possibly directed and/or weighted, hypergraphs, rather than merely as graphs.
Marzieh Eidi, Jürgen Jost
doaj +1 more source