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
Counting Homomorphic Cycles in Degenerate Graphs
Lior Gishboliner
, Yevgeny Levanzov
, Asaf Shapira
,
Raphael Yuster
Department of Mathematics
Research output
:
Contribution to journal
›
Article
›
peer-review
Overview
Fingerprint
Fingerprint
Dive into the research topics of 'Counting Homomorphic Cycles in Degenerate Graphs'. Together they form a unique fingerprint.
Sort by
Weight
Alphabetically
Keyphrases
Black-box Reductions
25%
Degenerate Graphs
100%
Digraph
50%
Directed Cycle
50%
Directed Graph
25%
Fast Algorithm
25%
General Digraphs
25%
General Directed Graphs
25%
General Graphs
25%
Graph Families
25%
Homomorphic
100%
Homomorphism
25%
K-cycle
25%
Matrix multiplication
25%
One-part
25%
Planar Graph
25%
Subgraph Counting
25%
Tight
25%
Time Algorithm
25%
Undirected Graph
25%
Walks on Graphs
25%
Mathematics
Black Box
50%
Degenerate Graph
100%
Directed Cycle
100%
Edge
100%
Fast Algorithm
50%
Homomorphism
50%
Main Result
50%
Matrix Multiplication
50%
Planar Graph
50%