z-logo
open-access-imgOpen Access
Proximity Search for Maximal Subgraph Enumeration
Author(s) -
Alessio Conte,
Roberto Grossi,
Andrea Marino,
Takeaki Uno,
Luca Versari
Publication year - 2022
Publication title -
siam journal on computing
Language(s) - Uncategorized
Resource type - Journals
SCImago Journal Rank - 1.533
H-Index - 122
eISSN - 1095-7111
pISSN - 0097-5397
DOI - 10.1137/20m1375048
Subject(s) - enumeration , mathematics , combinatorics , bipartite graph , discrete mathematics , tree traversal , exponential function , pspace , bounded function , time complexity , chordal graph , polynomial , epigraph , graph , algorithm , mathematical optimization , computational complexity theory , mathematical analysis

The content you want is available to Zendy users.

Already have an account? Click here to sign in.
Having issues? You can contact us here
Accelerating Research

Address

John Eccles House
Robert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom