Login / Signup
Efficient Enumeration of Induced Matchings in a Graph without Cycles with Length Four.
Kazuhiro Kurita
Kunihiro Wasa
Takeaki Uno
Hiroki Arimura
Published in:
IEICE Trans. Fundam. Electron. Commun. Comput. Sci. (2018)
Keyphrases
</>
random walk
search engine
knowledge base
pairwise
search space
information retrieval
lower bound
lightweight
directed graph
bipartite graph
weighted graph
graph theoretic
proximity search
grows quadratically