Results 51 to 60 of about 327 (90)
The generalized minimum spanning tree problem [PDF]
, 2000 We consider the Generalized Minimum Spanning Tree Problem denoted by GMSTP. It is known that GMSTP is NP-hard and even finding a near optimal solution is NP-hard.
Kern, W., Pop, P.C., Still, G.J.
core +2 more sources
Solving the minimum labelling spanning tree problem using hybrid local search [PDF]
, 2007 Given a connected, undirected graph whose edges are labelled (or coloured), the minimum labelling spanning tree (MLST) problem seeks a spanning tree whose edges have the smallest number of distinct labels (or colours).
Consoli, S +3 more
core
Seeded PageRank Solution Paths
, 2015 We study the behavior of network diffusions based on the PageRank random walk from a set of seed nodes. These diffusions are known to reveal small, localized clusters (or communities) and also large macro-scale clusters by varying a parameter that has a ...
Gleich, David F., Kloster, Kyle
core +1 more source
On the Lovasz O-number of Almost Regular Graphs With Application to Erdos-Renyi Graphs [PDF]
AMS classifications: 05C69; 90C35; 90C22;Erdos-Renyi graph;stability number;Lovasz O-number;Schrijver O-number;C*-algebra;semidefinite ...
Klerk, E. de +3 more
core +1 more source
Directed paths with few or many colors in colored directed graphs [PDF]
, 2000 Given a graph $D=(V(D),A(D))$ and a coloring of $D$, not necessarily a proper coloring of either the arcs or the vertices of $D$, we consider the complexity of finding a path of $D$ from a given vertex $s$ to another given vertex $t$ with as few ...
Broersma, H.J., Li, X., Zhang, S.
core +1 more source
Finding weakly reversible realizations of chemical reaction networks using optimization
, 2011 An algorithm is given in this paper for the computation of dynamically equivalent weakly reversible realizations with the maximal number of reactions, for chemical reaction networks (CRNs) with mass action kinetics.
Hangos, Katalin M. +2 more
core
Central hubs prediction for bio networks by directed hypergraph - GA with validation to COVID-19 PPI. [PDF]
Pattern Recognit Lett, 2022 Gopalakrishnan S +4 more
europepmc +1 more source
Extended Dijkstra algorithm and Moore-Bellman-Ford algorithm
, 2017 Study the general single-source shortest path problem. Firstly, define a path function on a set of some path with same source on a graph, and develop a kind of general single-source shortest path problem (GSSSP) on the defined path function.
Cheng, Cong-Dian
core
Fiduciary Responsibility and the Green Energy Act, 2009 (Ontario, Canada). [PDF]
Environ Justice, 2021 Tsuji SRJ.
europepmc +1 more source
The four-in-a-tree problem in triangle-free graphs [PDF]
The three-in-a-tree algorithm of Chudnovsky and Seymour decides in time O(n4) whether three given vertices of a graph belong to an induced tree. Here, we study four-in-a-tree for triangle-free graphs. We give a structural answer to the following question
Christophe Picouleau +2 more
core