AI Chat AI Image Generator AI Video Text to Speech

The Densest k Subgraph Problem in b-Outerplanar Graphs

07/08/2019

∙

by Sean Gonzales, et al.

∙

∙

We give an exact O(nk^2) algorithm for finding the densest k subgraph in outerplanar graphs. We extend this to an exact O(nk^2 8^b) algorithm for finding the densest k subgraph in b-outerplanar graphs. Finally, we hypothesize that Baker's PTAS technique will not work for the densest k subgraph problem in planar graphs.

Sean Gonzales
1 publication
Theresa Migler
1 publication

page 1

page 2

page 3

page 4

research

∙ 11/23/2022

A note on graphs with purely imaginary per-spectrum

In 1983, Borowiecki and Jóźwiak posed an open problem of characterizing ...

0 Hitesh Wankhede, et al. ∙

research

∙ 03/23/2022

On Factors with Prescribed Degrees in Bipartite Graphs

We establish a new criterion for a bigraph to have a subgraph with presc...

0 Amin Bahmanian, et al. ∙

research

∙ 03/13/2022

Distributed Subgraph Finding: Progress and Challenges

This is a survey of the exciting recent progress made in understanding t...

0 Keren Censor-Hillel, et al. ∙

research

∙ 05/30/2022

Harnessing spectral representations for subgraph alignment

With the rise and advent of graph learning techniques, graph data has be...

0 Marco Pegoraro, et al. ∙

research

∙ 02/19/2019

Dominator Colorings of Digraphs

This paper serves as the first extension of the topic of dominator color...

0 Michael Cary, et al. ∙

research

∙ 10/20/2022

Maximum Common Subgraph Guided Graph Retrieval: Late and Early Interaction Networks

The graph retrieval problem is to search in a large corpus of graphs for...

0 Indradyumna Roy, et al. ∙

research

∙ 01/09/2023

Structural Equivalence in Subgraph Matching

Symmetry plays a major role in subgraph matching both in the description...

0 Dominic Yang, et al. ∙