Add to ORKGThis thesis expands on the notion of linear complexity for a graph as defined by Michael Orrison and David Neel in their paper The Linear Complexity of a Graph. It considers additional classes of graphs and provides upper bounds for additional types of graphs and graph operations
In this paper we show that the contiguity and linearity of cographs on n vertices are both O(log n)....
Le sujet de cette thèse est la théorie des graphes. Formellement, un graphe est un ensemble de somme...
We study structured linear systems and structured linear programs (LPs) from both algorithm and comp...
This thesis expands on the notion of linear complexity for a graph as defined by Michael Orrison and...
The linear complexity of a matrix is a measure of the number of additions, subtractions, and scalar ...
Linearity and contiguity are two parameters devoted to graph encoding. Linearity is a generalization...
International audienceLinearity and contiguity are two parameters devoted to graph encoding. Lineari...
We call a simple graph G a linear N-graph if its ordinary (vertex) chromatic number equals to the l...
This study examines the complexity of linear algebra. Complexity means how much work, or the number ...
International audienceIn this paper we show that the contiguity and linearity of cographs on n verti...
AbstractThis paper originates from the observation that many classical NP graph problems, including ...
This book focuses on some of the main notions arising in graph theory, with an emphasis throughout o...
Kolmogorov complexity is a theory based on the premise that the complexity of a binary string can be...
AbstractA graph grammar is linear if it generates graphs with at most one nonterminal node. Linear g...
AbstractA proper vertex coloring of a graph is called linear if the subgraph induced by the vertices...
In this paper we show that the contiguity and linearity of cographs on n vertices are both O(log n)....
Le sujet de cette thèse est la théorie des graphes. Formellement, un graphe est un ensemble de somme...
We study structured linear systems and structured linear programs (LPs) from both algorithm and comp...
This thesis expands on the notion of linear complexity for a graph as defined by Michael Orrison and...
The linear complexity of a matrix is a measure of the number of additions, subtractions, and scalar ...
Linearity and contiguity are two parameters devoted to graph encoding. Linearity is a generalization...
International audienceLinearity and contiguity are two parameters devoted to graph encoding. Lineari...
We call a simple graph G a linear N-graph if its ordinary (vertex) chromatic number equals to the l...
This study examines the complexity of linear algebra. Complexity means how much work, or the number ...
International audienceIn this paper we show that the contiguity and linearity of cographs on n verti...
AbstractThis paper originates from the observation that many classical NP graph problems, including ...
This book focuses on some of the main notions arising in graph theory, with an emphasis throughout o...
Kolmogorov complexity is a theory based on the premise that the complexity of a binary string can be...
AbstractA graph grammar is linear if it generates graphs with at most one nonterminal node. Linear g...
AbstractA proper vertex coloring of a graph is called linear if the subgraph induced by the vertices...
In this paper we show that the contiguity and linearity of cographs on n vertices are both O(log n)....
Le sujet de cette thèse est la théorie des graphes. Formellement, un graphe est un ensemble de somme...
We study structured linear systems and structured linear programs (LPs) from both algorithm and comp...