Are unique subgraphs not easier to find?
type: Item
instance of: scholarly article
title: Are unique subgraphs not easier to find?
zbMATH Open document ID: 1476.68211
author: Mirosław Kowaluk
author: Andrzej Lingas
published in: Information Processing Letters
publication date: 2018-04-04T00:00:00Z
Mathematics Subject Classification ID: 68R10
Mathematics Subject Classification ID: 05C60
Mathematics Subject Classification ID: 68Q25
zbMATH DE Number: 6855757
zbMATH Keywords: subgraph isomorphism
zbMATH Keywords: induced subgraph isomorphism
zbMATH Keywords: unique subgraph occurrence
zbMATH Keywords: time complexity
MaRDI profile type: Publication
full work available at URL: j.ipl.2018.02.010
OpenAlex ID: W2790074285
cites work: Derandomization, witnesses for Boolean matrix multiplication and construction of perfect hash functions
cites work: Color-coding
cites work: Finding and counting given length cycles
cites work: Arboricity and Subgraph Listing Algorithms
cites work: On the complexity of fixed parameter clique and dominating set
cites work: Subgraph Isomorphism in Planar Graphs and Related Problems
cites work: Unique maximum matching algorithms
cites work: Fast rectangular matrix multiplication and applications
cites work: Finding a Minimum Circuit in a Graph
cites work: Finding and counting small induced subgraphs efficiently
cites work: Unique Lowest Common Ancestors in Dags Are Almost as Easy as Matrix Multiplication
cites work: Unique subgraphs are not easier to find
cites work: Q5365132
cites work: Q3688439
cites work: Q4028099
cites work: Experimental and Efficient Algorithms
cites work: NP is as easy as detecting unique solutions
cites work: Finding, minimizing, and counting weighted subgraphs
cites work: Finding Four-Node Subgraphs in Triangle Time
DOI: 10.1016/J.IPL.2018.02.010
description: scientific article; zbMATH DE number 6855757