Sciweavers

1404 search results - page 4 / 281
» Optimization problems in multiple-interval graphs
Sort
View
ORL
2007
102views more  ORL 2007»
13 years 9 months ago
Using critical sets to solve the maximum independent set problem
A method that utilizes the polynomially solvable critical independent set problem for solving the maximum independent set problem on graphs with a nonempty critical independent se...
Sergiy Butenko, Svyatoslav Trukhanov
GC
2010
Springer
13 years 8 months ago
Star-Uniform Graphs
A star-factor of a graph is a spanning subgraph each of whose components is a star. A graph
Mikio Kano, Yunjian Wu, Qinglin Yu
CORR
2010
Springer
198views Education» more  CORR 2010»
13 years 6 months ago
Convex Graph Invariants
The structural properties of graphs are usually characterized in terms of invariants, which are functions of graphs that do not depend on the labeling of the nodes. In this paper ...
Venkat Chandrasekaran, Pablo A. Parrilo, Alan S. W...
MICS
2010
124views more  MICS 2010»
13 years 4 months ago
An Optimal Algorithm for the k-Fixed-Endpoint Path Cover on Proper Interval Graphs
In this paper we consider the k-fixed-endpoint path cover problem on proper interval graphs, which is a generalization of the path cover problem. Given a graph G and a set T of k v...
George B. Mertzios, Walter Unger
SIAMCOMP
2000
118views more  SIAMCOMP 2000»
13 years 9 months ago
On Bipartite Drawings and the Linear Arrangement Problem
The bipartite crossing number problem is studied, and a connection between this problem and the linear arrangement problem is established. It is shown that when the arboricity is ...
Farhad Shahrokhi, Ondrej Sýkora, Lás...