Publication date
March 2019
DOIAbstract
We show that ordering vertices of a graph subject to some objective function is a difficult task
We show that ordering vertices of a graph subject to some objective function is a difficult task
We consider the problem of determining a balanced ordering of the vertices of a graph; that is, the ...
AbstractAn edge ranking of a graph is a restricted coloring of the edges with integers. It requires ...
© 2020 Copyright held by the owner/author(s). Many graph problems can be solved using ordered parall...
Combinatorial Optimization problems play central role in applied mathematics and computer science. A...
We are given an $n$ vertex directed graph $G=(V,E)$ and also given a cost function $c:V\times [n]\to...
Graphs and AlgorithmsWe consider the problem of finding a balanced ordering of the vertices of a gra...
A maximum weighted matching in a graph can be computed in polynomial time. In this paper we show tha...
An edge ranking of a graph is a restricted coloring of the edges with integers. It requires that eve...
We consider the problem of finding a balanced ordering of the vertices of a graph. More precisely, ...
Abstract: Given an ordering of the vertices of a graph one can construct a maximal stable set of tha...
We continue the study of priority or “greedy-like ” algorithms as initiated in [10] and as extended ...
The linear ordering problem (LOP) has a wide range of applications in several fields, such as schedu...
© 2005 by Chapman & Hall/CRC Press. Graph theory offers a rich source of problems and techniques f...
In this note, we give a proof that several vertex ordering problems can be solved in O ∗(2 n ) time ...
International audienceIn this paper, we study the complexity of the selection of a graph discretizat...
We consider the problem of determining a balanced ordering of the vertices of a graph; that is, the ...
AbstractAn edge ranking of a graph is a restricted coloring of the edges with integers. It requires ...
© 2020 Copyright held by the owner/author(s). Many graph problems can be solved using ordered parall...
Combinatorial Optimization problems play central role in applied mathematics and computer science. A...
We are given an $n$ vertex directed graph $G=(V,E)$ and also given a cost function $c:V\times [n]\to...
Graphs and AlgorithmsWe consider the problem of finding a balanced ordering of the vertices of a gra...
A maximum weighted matching in a graph can be computed in polynomial time. In this paper we show tha...
An edge ranking of a graph is a restricted coloring of the edges with integers. It requires that eve...
We consider the problem of finding a balanced ordering of the vertices of a graph. More precisely, ...
Abstract: Given an ordering of the vertices of a graph one can construct a maximal stable set of tha...
We continue the study of priority or “greedy-like ” algorithms as initiated in [10] and as extended ...
The linear ordering problem (LOP) has a wide range of applications in several fields, such as schedu...
© 2005 by Chapman & Hall/CRC Press. Graph theory offers a rich source of problems and techniques f...
In this note, we give a proof that several vertex ordering problems can be solved in O ∗(2 n ) time ...
International audienceIn this paper, we study the complexity of the selection of a graph discretizat...
We consider the problem of determining a balanced ordering of the vertices of a graph; that is, the ...
AbstractAn edge ranking of a graph is a restricted coloring of the edges with integers. It requires ...
© 2020 Copyright held by the owner/author(s). Many graph problems can be solved using ordered parall...
Add to ORKG