Recognizing and generating unswitchable graphs

04/12/2023
by   Asish Mukhopadhyay, et al.
0

In this paper, we show that unswitchable graphs are a proper subclass of split graphs, and exploit this fact to propose efficient algorithms for their recognition and generation.

READ FULL TEXT
research
11/23/2020

Recognizing Proper Tree-Graphs

We investigate the parameterized complexity of the recognition problem f...
research
06/27/2022

Recognition and Isomorphism of Proper U-graphs in FPT-time

An H-graph is an intersection graph of connected subgraphs of a suitable...
research
03/01/2018

Fast Algorithms for Indices of Nested Split Graphs Approximating Real Complex Networks

We present a method based on simulated annealing to obtain a nested spli...
research
11/29/2017

Split-Decomposition Trees with Prime Nodes: Enumeration and Random Generation of Cactus Graphs

In this paper, we build on recent results by Chauve et al. (2014) and Ba...
research
11/13/2022

Parallel and I/O-Efficient Algorithms for Non-Linear Preferential Attachment

Preferential attachment lies at the heart of many network models aiming ...
research
11/29/2020

Constructing Order Type Graphs using an Axiomatic Approach

A given order type in the plane can be represented by a point set. Howev...
research
07/14/2020

Algorithmic applications of the corestriction of central simple algebras

Let L be a separable quadratic extension of either ℚ or 𝔽_q(t). We propo...

Please sign up or login with your details

Forgot password? Click here to reset