weighted graph
An Efficient Algorithm for Calculating Maximum Flow in an Undirected Edge- Weighted Graph
... M. Stoer and F. Wagner presented an algorithm for finding the minimum cut of an undirected edge-weighted graph without using any flow techniques. This algorithm is one of a small number of papers treating ...
9
Predicting Valence Arousal Ratings of Words Using a Weighted Graph Method
... and graph-based meth- ods (PageRank and Weighted ...and Weighted Graph was taken from results of the 50th ...both graph-based methods out- performed the regression-based methods for all ...
6
Characteristic polynomials of some weighted graph bundles and its application to links
... In particular, we show that the characteristic polynomial of a weighted K2 K2bundles over a weighted graph F can be expressed as a product of characteristic polynomials two weighted grap[r] ...
8
Weighted graph matching approaches to structure comparison and alignment and their application to biological problems
... of graph matching problems where nodes can cut in-between the ...of weighted graphs out of an image, noise may cause a single line segment represented using two or more ...
110
End-to-End Structure-Aware Convolutional Networks for Knowledge Base Completion
... Knowledge graph embedding has been an active research topic for knowledge base completion, with progressive im- provement from the initial TransE, TransH, DistMult et al to the current state-of-the-art ...recent ...
8
A linear time algorithm for the minimum Weighted Feedback Vertex Set on diamonds
... vertex weighted graph G, the Weighted Feedback Vertex Problem (WFVP) consists in finding a subset F ⊆ V of vertices of minimum weight such that each cycle in G contains at least one vertex in ...
7
Randomized Decoding for Selection and Ordering Problems
... The task of selecting and ordering infor- mation appears in multiple contexts in text generation and summarization. For in- stance, methods for title generation con- struct a headline by selecting and order- ing words ...
8
Enhanced prim's algorithm for finding the hamiltonian cycle in a graph
... The Travelling Salesman Problem (TSP) is known as one of the oldest combinatorial optimisation problem which solves the path problem in weighted graph. This problem receives a lot of attention as it had ...
24
A New Quick Algorithm for Finding the Minimal Spanning Tree
... or graph G=(V,E), where V are the vertices or nodes and E are the edges or arcs, then a Spanning Tree of a graph G is a tree that spans G, that is it includes every vertex of G, and is a sub graph of ...
9
Seeing the results of a mutation with a vertex weighted hierarchical graph
... vertex weighted hier- archical method is coupled with a predicted change in the 3D ...level graph of the wild type protein and the mutant protein V51R respectively and were generated by Cytoscape ...level ...
8
Learning Word Representations from Relational Graphs
... relational graph, a directed labelled weighted graph where vertices repre- sent words and edges represent numerous semantic relations that exist between the corresponding words, we consider the ...
7
Is blood pressure reduction a valid surrogate endpoint for stroke prevention? an analysis incorporating a systematic review of randomised controlled trials, a by-trial weighted errors-in-variables regression, the surrogate threshold effect (STE) and the biomarker-surrogacy (BioSurrogate) evaluation schema (BSES)
... Context of surrogacy and impact of secular change in study design, trial populations and treatment modalities These STEs for systolic and diastolic blood pressure assume that the new trial measuring only the surrogate ...
21
Extension of graph clustering algorithms based on SCAN method in order to target weighted graphs
... Among the variety of existing clustering algorithms SCAN and other based on it algorithms (DHSCAN and AHSCAN) distinguish themselves as they exhibit some important features: the ability to identify nodes of a special ...
91
The weighted version of the handshaking lemma with an application
... Around the middle of the th century theoretical chemists recognized that useful in- formation on the dependence of various properties of organic substances on molecular structure can be obtained by examining ...
5
Combinatorial optimization with 2-joins
... Our main results are Theorem 9.1 and 9.2. They say that for Berge graphs with no balanced skew partition, no 2-join in the complement and no homogeneous pair, the following problems can be solved combinatorially in ...
57
Topical Coherence for Graph based Extractive Summarization
... McDonald (2007) introduces summarization as an optimization task which takes care of importance, redundancy and coherence simultaneously. In this paper, we also propose a model for single doc- ument summarization which ...
6
Graph based transform with weighted self loops for predictive transform coding based on template matching
... the first and last vertices (see Fig. 1(a)). Based on this fact, the authors learn the self-loop weights that produce efficient Graph-based Separable Transforms (GBSTs) for block-based PTC of intra-predicted video ...
11
Hybrid coexpression link similarity graph clustering for mining biological modules from multiple gene expression datasets
... Functional enrichment analysis of the reported modules (minimum recurrence of 5, and heaviness equals 0.5) revealed that about 50% of these modules are enriched with at least one biological process GO term. Moreover, 17% ...
16
Image classification : a study in age-related macular degeneration screening
... [107]. Weighted Frequent Sub-graph Mining (WFSM) algorithms distinguish between the relative importance of graph nodes by assigning weights to nodes and/or ...generate graph weights in ...
221
Fast filtering and animation of large dynamic networks
... nodes. Graph readability has been measured in user studies in relation to several tasks [–]; the ex- perimental findings highlight the importance of visualization criteria such as minimizing bends and edge ...
16