Login / Signup
A Polynomial-Time Algorithm for Computing the Maximum Common Connected Edge Subgraph of Outerplanar Graphs of Bounded Degree.
Tatsuya Akutsu
Takeyuki Tamura
Published in:
Algorithms (2013)
Keyphrases
</>
graph isomorphism
graph mining
graph databases
optimal solution
np hard
computational complexity
objective function
weighted graph
graph model
undirected graph
graph data
graph search
planar graphs
subgraph mining
dynamic programming
binary images
tree structure
graph structure
special case
graph patterns