Branch-and-bound techniques for the maximum planar subgraph problem<sup>∗</sup> (Q4844576): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
 
(3 intermediate revisions by 3 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1080/00207169408804320 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2015924510 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A linear algorithm for embedding planar graphs using PQ-trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Finding a Maximum Clique in an Arbitrary Graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: Testing for the consecutive ones property, interval graphs, and graph planarity using PQ-tree algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: An $O(m\log n)$-Time Algorithm for the Maximal Planar Subgraph Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: An analysis of heuristics for graph planarization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Facilities Layout Adjacency Determination: An Experimental Comparison of Three Graph Theoretic Heuristics / rank
 
Normal rank
Property / cites work
 
Property / cites work: On linear-time algorithms for five-coloring planar graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: An efficient graph planarization two‐phase heuristic / rank
 
Normal rank
Property / cites work
 
Property / cites work: Efficient Planarity Testing / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Efficient Heuristic Procedure for Partitioning Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: A batching method for coloring planar graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3866146 / rank
 
Normal rank
Property / cites work
 
Property / cites work: An algorithm for finding a maximum weighted independent set in an arbitrary graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: Finding a Maximum Independent Set / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 17:01, 23 May 2024

scientific article; zbMATH DE number 790914
Language Label Description Also known as
English
Branch-and-bound techniques for the maximum planar subgraph problem<sup>∗</sup>
scientific article; zbMATH DE number 790914

    Statements

    Branch-and-bound techniques for the maximum planar subgraph problem<sup>∗</sup> (English)
    0 references
    10 October 1995
    0 references
    branch-and-bound algorithms
    0 references

    Identifiers