Skip to main navigation
Skip to search
Skip to main content
University of Haifa Home
Update your profile
Link opens in a new tab
Search content at University of Haifa
Home
Researchers
Research units
Research output
Finding heaviest H-subgraphs in real weighted graphs, with applications
Virginia Vassilevska
, Ryan Williams
,
Raphael Yuster
Department of Mathematics
Research output
:
Contribution to journal
›
Article
›
peer-review
Overview
Fingerprint
Fingerprint
Dive into the research topics of 'Finding heaviest H-subgraphs in real weighted graphs, with applications'. Together they form a unique fingerprint.
Sort by
Weight
Alphabetically
Keyphrases
Weighted Graph
100%
All-pairs
100%
Time Algorithm
66%
Heavy Cycles
66%
Randomized Algorithms
33%
Subcubic
33%
Improved Algorithm
33%
Rectangular Matrix multiplication
33%
Existing Algorithms
33%
Edge Weight
33%
Exponent of Matrix multiplication
33%
Unweighting
33%
Integer Programming
33%
Total Weight
33%
Distance Product
33%
M2-1
33%
Detection Problem
33%
Graph Anomaly Detection
33%
Fast Matrix multiplication
33%
Vertex-weighted Graph
33%
Real Weight
33%
Fixed-length
33%
Edge-colored Graph
33%
Most Significant Bit
33%
Real Matrix
33%
Strongly Polynomial Algorithm
33%
Mathematics
Edge
100%
weighted graph
100%
Matrix Multiplication
50%
Triangle
50%
Main Result
25%
Integer
25%
Polynomial
25%
Running Time
25%
Multiplication of Matrix
25%
Total Weight
25%
Real Matrix
25%
Computer Science
Subgraphs
100%
weighted graph
100%
Matrix Multiplication
60%
Randomized Algorithm
20%
Efficient Algorithm
20%
Integer Program
20%
Polynomial Algorithm
20%
Distance Product
20%
Most Significant Bit
20%