Intersection number (graph theory)

Known as: Clique edge cover, Intersection graph basis

In the mathematical field of graph theory, the intersection number of a graph G = (V,E) is the smallest number of elements in a representation of G…

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.

2019

Learning to predict solutions to real-valued combinatorial graph problems promises efficient approximations. As demonstrated…

2018

In this paper, we relate the competition number of a graph to its edge clique cover number by presenting a tight inequality k(G…

2016

Kernelization is a significant topic in parameterized complexity. Turing kernelization is a general form of kernelization. For…

2016

In this paper, we relate the competition number of a graph to its edge clique cover number by presenting a tight inequality $k(G…

2012

Kernelization is a core tool of parameterized algorithmics for coping with computationally intractable problems. A kernelization…

2009

A typical first step of a direct solver for linear system Mx = b is reordering of symmetric matrix M to improve execution time…

2006

2002

An ongoing project of the authors is the development of a computer system which manipulates a data base composed of !inequalities…

1992

Given a digraph $D = ( V,A )$ and a positive integer p, the p-competition graph of D, denoted $C_p ( D )$, is defined to have…

1984