AI Chat AI Image Generator AI Video Text to Speech

Shote note:Revisiting Linear Width: Rethinking the Relationship Between Single Ideal and Linear Obstacle

05/08/2023

∙

by Takaaki Fujita, et al.

∙

∙

Linear-width is a well-known and highly regarded graph parameter. The concept of Single Ideal and Linear obstacle serves as an obstruction to linear-width on a connectivity sysem. In this concise paper, we present an alternative proof for the equivalence between Single ideal and linear obstacle.

page 1

page 2

page 3

page 4

research

∙ 05/07/2023

Reconsideration of Tangle and Ultrafilter using Separation and Partition

Tangle is a concept in graph theory that has a dual relationship with br...

0 Takaaki Fujita, et al. ∙

research

∙ 07/09/2019

Linear MIM-Width of Trees

We provide an O(n log n) algorithm computing the linear maximum induced ...

0 Svein Høgemo, et al. ∙

research

∙ 01/21/2021

A Note on Connectivity of Sublevel Sets in Deep Learning

It is shown that for deep neural networks, a single wide layer of width ...

0 Quynh Nguyen, et al. ∙

research

∙ 12/15/2022

Twin-width of random graphs

We investigate the twin-width of the Erdős-Rényi random graph G(n,p). We...

0 Jungho Ahn, et al. ∙

research

∙ 05/03/2021

Acoustic passive cloaking using thin outer resonators

We consider the propagation of acoustic waves in a 2D waveguide unbounde...

0 Lucas Chesnel, et al. ∙

research

∙ 01/06/2023

On the Width of the Regular n-Simplex

Consider the regular n-simplex Δ_n - it is formed by the convex-hull of ...

0 Sariel Har-Peled, et al. ∙

research

∙ 06/25/2023

Exploring two concepts: branch decomposition and weak ultrafilter on connectivity system

This paper explores two fundamental concepts: branch width and weak ultr...

0 Takaaki Fujita, et al. ∙