Co-bipartite neighborhood edge elimination orderings
From MaRDI portal
Publication:1689989
DOI10.1016/j.endm.2017.07.020zbMath1379.05086OpenAlexW2743410097MaRDI QIDQ1689989
Erik Jan van Leeuwen, Wanchote Po Jiamjitrak
Publication date: 18 January 2018
Full work available at URL: http://dspace.library.uu.nl/handle/1874/361077
Analysis of algorithms and problem complexity (68Q25) Extremal problems in graph theory (05C35) Graph algorithms (graph-theoretic aspects) (05C85) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)
Cites Work
- Unnamed Item
- Approximation algorithms for intersection graphs
- Unit disk graphs
- A special planar satisfiability problem and a consequence of its NP- completeness
- The complexity of \(G\)-free colourability
- Unit disk graph recognition is NP-hard
- The clique problem in intersection graphs of ellipses and triangles
- Vertex-partitioning into fixed additive induced-hereditary properties is NP-hard
- Integer realizations of disk and segment graphs
- Finding the connected components and a maximum clique of an intersection graph of rectangles in the plane
- Max-tolerance graphs as intersection graphs
- The Complexity of the Partial Order Dimension Problem
- A New Algorithm for Generating All the Maximal Independent Sets
- Robust algorithms for restricted domains
- Intersection graphs of homothetic polygons
- Algorithm Theory - SWAT 2004
