scientific article
From MaRDI portal
Publication:3140413
zbMath0801.68128MaRDI QIDQ3140413
Elaine M. Eschen, Jeremy P. Spinrad
Publication date: 15 December 1993
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10) Isomorphism problems in graph theory (reconstruction conjecture, etc.) and homomorphisms (subgraph embedding, etc.) (05C60)
Related Items
Doubly lexical ordering of dense 0--1 matrices, On the structure of certain intersection graphs, Paired domination on interval and circular-arc graphs, Tree loop graphs, Maximum max-k-clique subgraphs in cactus subtree graphs, Recognition of Polygon-Circle Graphs and Graphs of Interval Filaments Is NP-Complete, Algorithms for induced biclique optimization problems, A simpler linear-time recognition of circular-arc graphs, On the vertex ranking problem for trapezoid, circular-arc and other graphs, Two remarks on circular arc graphs, An optimal parallel algorithm for solving all-pairs shortest paths problem on circular-arc graphs, An efficient certifying algorithm for the Hamiltonian cycle problem on circular-arc graphs, Circular-arc graph coloring: On chords and circuits in the meeting graph, Characterizations and recognition of circular-arc graphs and subclasses: a survey, Solving the path cover problem on circular-arc graphs by using an approximation algorithm, Colouring Some Classes of Perfect Graphs Robustly, BOB: Improved winner determination in combinatorial auctions and generalizations
