The computational complexity of the Edge-Perfect Graph and the Totally Balanced Packing Game recognition problems (original) (raw)
María Patricia Dobson2010, Electronic Notes in Discrete Mathematics
visibility
…
description
8 pages
link
1 file
Sign up for access to the world's latest research.
checkGet notified about relevant papers
checkSave papers to use in your research
checkJoin the discussion with peers
checkTrack your impact
Related papers
The graph distance game and some graph operations
Electronic Notes in Discrete Mathematics, 2014
On Some Classes of Problems on Graphs
International Conference on Information and Communication Technologies in Education, Research, and Industrial Applications, 2019
Discrete Optimization, 2013
We characterize edge-perfect graphs and prove that it is co-NP-complete to recognize them. In consequence, recognizing the defining matrices of totally balanced packing games is also co-NP-complete, in contrast with the polynomiality for the covering case. In addition, we solve the computational complexity of universally balanced (with respect to the resources constraints) packing games.
A note on packing paths in planar graphs
Mathematical Programming, 1995
Generalized limited packings of some graphs with a limited number of P4-partners
Theoretical Computer Science, 2015
The neighbour-sum-distinguishing edge-colouring game
Discrete Mathematics, 2017
The Algorithmics of Solitaire-Like Games
Springer eBooks, 2010
Journal of Graph Algorithms and Applications
Combinatorial analysis of Tetris-like games
Discrete Mathematics, 2008
Discrete Applied Mathematics, 2017
Loading Preview
Sorry, preview is currently unavailable. You can download the paper by clicking the button above.
Related papers
Weakly cyclic graphs and delivery games
J Econ Behav Organ, 1996
Computing good allocations for combinatorial optimization games
2006
Theoretical Computer Science, 2014
Computers & Mathematics with Applications, 2000
Acceptable points in games of perfect information
Pacific Journal of Mathematics, 1960
Knowing and Supposing in Games of Perfect Information
Studia Logica, 2007
Springer eBooks, 2010
On the locatic number of graphs
Resource selection games with unknown number of players
A world championship caliber checkers program
Artificial Intelligence, 1992
The Balanced Connected Subgraph Problem
Algorithms and Discrete Applied Mathematics, 2019
The strong game colouring number of directed graphs
Discrete Mathematics, 2013
Recognition Algorithm for Diamond-Free Graphs
Informatica
On the Geometry of Graph Arrangements
2004
Aaai, 1983
Computational Complexity of Discrete Problems (Dagstuhl Seminar 19121)
2019
Graph Guessing Games and Non-Shannon Information Inequalities
IEEE Transactions on Information Theory
Competitive Analysis of Algorithms
1996
International Journal of Pure and Apllied Mathematics, 2015
Combinatorially simple pickup and delivery paths
2004
Bounding and computing obstacle numbers of graphs
arXiv (Cornell University), 2022
An On-Line Algorithm for the Rectangle Packing Problem with Rejection
2003
Efficient algorithms for combinatorial problems on graphs with bounded decomposability — A survey
BIT, 1985
The Complexity of Defining a Relation on a Finite Graph
Zeitschrift für Mathematische Logik und Grundlagen der Mathematik, 1987
1999
Related topics
MathematicsComputer ScienceComputational ComplexityGraph TheoryCombinatoricsPerfect Graph