Sciweavers

311 search results - page 4 / 63
» Graph Classes Between Parity and Distance-hereditary Graphs
Sort
View
CATS
2008
13 years 9 months ago
Graph Classes and the Complexity of the Graph Orientation Minimizing the Maximum Weighted Outdegree
Given an undirected graph with edge weights, we are asked to find an orientation, i.e., an assignment of a direction to each edge, so as to minimize the weighted maximum outdegree...
Yuichi Asahiro, Eiji Miyano, Hirotaka Ono
MOR
2010
111views more  MOR 2010»
13 years 5 months ago
Generalized Domino-Parity Inequalities for the Symmetric Traveling Salesman Problem
We extend the work of Letchford (2000) by introducing a new class of valid inequalities for the traveling salesman problem, called the generalized domino-parity (GDP) constraints....
William J. Cook, Daniel G. Espinoza, Marcos Goycoo...
ISAAC
2009
Springer
169views Algorithms» more  ISAAC 2009»
14 years 2 months ago
The Complexity of Solving Stochastic Games on Graphs
We consider some well-known families of two-player zero-sum perfect-information stochastic games played on finite directed graphs. Generalizing and unifying results of Liggett and...
Daniel Andersson, Peter Bro Miltersen
DAM
2008
123views more  DAM 2008»
13 years 7 months ago
Polar cographs
Polar graphs are a natural extension of some classes of graphs like bipartite graphs, split graphs and complements of bipartite graphs. A graph is (s, k)-polar if there exists a pa...
Tinaz Ekim, Nadimpalli V. R. Mahadev, Dominique de...
LICS
2003
IEEE
14 years 22 days ago
Micro-Macro Stack Systems: A New Frontier of Elementary Decidability for Sequential Systems
We define the class of micro-macro stack graphs, a new class of graphs modeling infinite-state sequential systems with a decidable model-checking problem. Micro-macro stack grap...
Nir Piterman, Moshe Y. Vardi