Lower bounds on time complexity for some subgraph detection problems

Masanari Arai, Masafumi Yamashita, Tomio Hirata, Toshihide Ibaraki, Namio Honda

Research output: Contribution to journalArticle

Abstract

Nontrivial lower bounds of the time complexity are given for a class of problems on graphs. Specifically, given a complete graph with weighted edges, the problem of finding a subgraph satisfying a property π and having edge‐weights that sum exactly to unity is considered. An ω(n3 log n) lower bound is established under the algebraic decision tree model for a property π that satisfies the degree constraint and is closed with respect to isomorphism, where n is the number of vertices in an input graph. This result is a proper generalization of that of Nakayama et al. [8], in which the same lower bound was obtained for π that is hereditary on subgraphs and determined by components. Furthermore, an ω(n3) lower bound is shown for π = “clique” that does not satisfy the degree constraint and hence the above result can not be applied.

Original languageEnglish
Pages (from-to)95-102
Number of pages8
JournalSystems and Computers in Japan
Volume17
Issue number6
DOIs
Publication statusPublished - 1986

Fingerprint

Decision trees
Time Complexity
Subgraph
Lower bound
Graph in graph theory
Clique
Decision tree
Complete Graph
Isomorphism
Closed
Model

All Science Journal Classification (ASJC) codes

  • Theoretical Computer Science
  • Information Systems
  • Hardware and Architecture
  • Computational Theory and Mathematics

Cite this

Lower bounds on time complexity for some subgraph detection problems. / Arai, Masanari; Yamashita, Masafumi; Hirata, Tomio; Ibaraki, Toshihide; Honda, Namio.

In: Systems and Computers in Japan, Vol. 17, No. 6, 1986, p. 95-102.

Research output: Contribution to journalArticle

Arai, M, Yamashita, M, Hirata, T, Ibaraki, T & Honda, N 1986, 'Lower bounds on time complexity for some subgraph detection problems', Systems and Computers in Japan, vol. 17, no. 6, pp. 95-102. https://doi.org/10.1002/scj.4690170611
Arai, Masanari ; Yamashita, Masafumi ; Hirata, Tomio ; Ibaraki, Toshihide ; Honda, Namio. / Lower bounds on time complexity for some subgraph detection problems. In: Systems and Computers in Japan. 1986 ; Vol. 17, No. 6. pp. 95-102.
@article{5b93891c2ab443ce9b83b827059524ed,
title = "Lower bounds on time complexity for some subgraph detection problems",
abstract = "Nontrivial lower bounds of the time complexity are given for a class of problems on graphs. Specifically, given a complete graph with weighted edges, the problem of finding a subgraph satisfying a property π and having edge‐weights that sum exactly to unity is considered. An ω(n3 log n) lower bound is established under the algebraic decision tree model for a property π that satisfies the degree constraint and is closed with respect to isomorphism, where n is the number of vertices in an input graph. This result is a proper generalization of that of Nakayama et al. [8], in which the same lower bound was obtained for π that is hereditary on subgraphs and determined by components. Furthermore, an ω(n3) lower bound is shown for π = “clique” that does not satisfy the degree constraint and hence the above result can not be applied.",
author = "Masanari Arai and Masafumi Yamashita and Tomio Hirata and Toshihide Ibaraki and Namio Honda",
year = "1986",
doi = "10.1002/scj.4690170611",
language = "English",
volume = "17",
pages = "95--102",
journal = "Systems and Computers in Japan",
issn = "0882-1666",
publisher = "John Wiley and Sons Inc.",
number = "6",

}

TY - JOUR

T1 - Lower bounds on time complexity for some subgraph detection problems

AU - Arai, Masanari

AU - Yamashita, Masafumi

AU - Hirata, Tomio

AU - Ibaraki, Toshihide

AU - Honda, Namio

PY - 1986

Y1 - 1986

N2 - Nontrivial lower bounds of the time complexity are given for a class of problems on graphs. Specifically, given a complete graph with weighted edges, the problem of finding a subgraph satisfying a property π and having edge‐weights that sum exactly to unity is considered. An ω(n3 log n) lower bound is established under the algebraic decision tree model for a property π that satisfies the degree constraint and is closed with respect to isomorphism, where n is the number of vertices in an input graph. This result is a proper generalization of that of Nakayama et al. [8], in which the same lower bound was obtained for π that is hereditary on subgraphs and determined by components. Furthermore, an ω(n3) lower bound is shown for π = “clique” that does not satisfy the degree constraint and hence the above result can not be applied.

AB - Nontrivial lower bounds of the time complexity are given for a class of problems on graphs. Specifically, given a complete graph with weighted edges, the problem of finding a subgraph satisfying a property π and having edge‐weights that sum exactly to unity is considered. An ω(n3 log n) lower bound is established under the algebraic decision tree model for a property π that satisfies the degree constraint and is closed with respect to isomorphism, where n is the number of vertices in an input graph. This result is a proper generalization of that of Nakayama et al. [8], in which the same lower bound was obtained for π that is hereditary on subgraphs and determined by components. Furthermore, an ω(n3) lower bound is shown for π = “clique” that does not satisfy the degree constraint and hence the above result can not be applied.

UR - http://www.scopus.com/inward/record.url?scp=0022737645&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=0022737645&partnerID=8YFLogxK

U2 - 10.1002/scj.4690170611

DO - 10.1002/scj.4690170611

M3 - Article

AN - SCOPUS:0022737645

VL - 17

SP - 95

EP - 102

JO - Systems and Computers in Japan

JF - Systems and Computers in Japan

SN - 0882-1666

IS - 6

ER -