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
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...
AbstractLet G be a simple (nondirected) graph with degree sequence d1, d2,…, dn. The number of spann...
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...
This study examines the complexity of linear algebra. Complexity means how much work, or the number ...
Kolmogorov complexity is a theory based on the premise that the complexity of a binary string can be...
International audienceIn this paper we show that the contiguity and linearity of cographs on n verti...
This book focuses on some of the main notions arising in graph theory, with an emphasis throughout o...
We call a simple graph G a linear N-graph if its ordinary (vertex) chromatic number equals to the l...
SIGLEAvailable from British Library Document Supply Centre-DSC:D201444 / BLDSC - British Library Doc...
SIGLEAvailable from British Library Document Supply Centre- DSC:D42000/82 / BLDSC - British Library ...
Throughout the years, measuring the complexity of networks and graphs has been of great interest to ...
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...
AbstractLet G be a simple (nondirected) graph with degree sequence d1, d2,…, dn. The number of spann...
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...
This study examines the complexity of linear algebra. Complexity means how much work, or the number ...
Kolmogorov complexity is a theory based on the premise that the complexity of a binary string can be...
International audienceIn this paper we show that the contiguity and linearity of cographs on n verti...
This book focuses on some of the main notions arising in graph theory, with an emphasis throughout o...
We call a simple graph G a linear N-graph if its ordinary (vertex) chromatic number equals to the l...
SIGLEAvailable from British Library Document Supply Centre-DSC:D201444 / BLDSC - British Library Doc...
SIGLEAvailable from British Library Document Supply Centre- DSC:D42000/82 / BLDSC - British Library ...
Throughout the years, measuring the complexity of networks and graphs has been of great interest to ...
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...
AbstractLet G be a simple (nondirected) graph with degree sequence d1, d2,…, dn. The number of spann...