Search
Search Results
-
Maximum Weighted Independent Set: Effective Reductions and Fast Algorithms on Sparse Graphs
The maximum independent set problem is one of the most important problems in graph algorithms and has been extensively studied in the line of...
-
Faster Cut Sparsification of Weighted Graphs
A cut sparsifier is a reweighted subgraph that maintains the weights of the cuts of the original graph up to a multiplicative factor of
... 
-
Extended Graph Assessment Metrics for Regression and Weighted Graphs
When re-structuring patient cohorts into so-called population graphs, initially independent patients can be incorporated into one interconnected...
-
Efficient computation of maximum weighted independent sets on weighted dynamic graph
An independent set is a set of vertices in a graph in which no two vertices are adjacent to each other. The maximum weighted independent set is the...
-
Generating Contextual Weighted Commonsense Knowledge Graphs
There has been a renewed interest in commonsense knowledge and reasoning. To achieve artificial general intelligence, systems must exhibit not only...
-
Application of Adapted Weighted Graphs for Solving the Problem of Flat-Trajectory Planning by the Potential Fields Method
AbstractIn this paper, we consider the problem of mobile-robot path planning. We present features of the potential fields method, which allows...
-
Discovering top-weighted k-truss communities in large graphs
Community Search is the problem of querying networks in order to discover dense subgraphs-communities-that satisfy given query parameters. Most...
-
-
Graphs
Many problems in Computer Science and Mathematics can be reduced to a set of states and a set of transitions between these states. A graph is a...
-
EvolveKG: a general framework to learn evolving knowledge graphs
A great many practical applications have observed knowledge evolution, i.e., continuous born of new knowledge, with its formation influenced by the...
-
Bundle Allocation with Conflicting Preferences Represented as Weighted Directed Acyclic Graphs
We introduce resource allocation techniques for a problem where (i) the agents express requests for obtaining item bundles as compact edge-weighted...
-
Better Distance Labeling for Unweighted Planar Graphs
A distance labeling scheme is an assignment of labels, that is, binary strings, to all nodes of a graph, so that the distance between any two nodes...
-
Attribute-Weighted Fuzzy Interpolative Reasoning
As exhibited previously, the weights of individual rule antecedent attributes can be computed through a reverse engineering procedure applied to the...
-
Weighted Connected Matchings
A matching M is a \(\mathscr {P}\) -matching if...
-
Similarity enhancement of heterogeneous networks by weighted incorporation of information
In many real-world datasets, different aspects of information are combined, so the data is usually represented as heterogeneous graphs whose nodes...
-
Centrality measures for node-weighted networks via line graphs and the matrix exponential
This paper is concerned with the identification of important nodes in node-weighted graphs by applying matrix functions, in particular the matrix...
-
Reverse Shortest Path Problem in Weighted Unit-Disk Graphs
Given a set P of n points in the plane, a unit-disk graph \(G_{r}(P)\)...
-
Interplay between topology and edge weights in real-world graphs: concepts, patterns, and an algorithm
What are the relations between the edge weights and the topology in real-world graphs? Given only the topology of a graph, how can we assign...
-
Vertex-Weighted Graphs: Realizable and Unrealizable Domains
Consider the following natural variation of the degree realization problem. Let...
-
