A simulated annealing algorithm for the maximum planar subgraph problem (Q4831415): Difference between revisions

From MaRDI portal
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
 
(2 intermediate revisions by 2 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/00207160410001684352 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2003965618 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Maximum planar subgraphs and nice embeddings: Practical layout tools / rank
 
Normal rank
Property / cites work
 
Property / cites work: Local Search Algorithms for the Maximal Planar Layout Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: The thickness of graphs: A survey / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the thickness and arboricity of a 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: Efficient Planarity Testing / rank
 
Normal rank
Property / cites work
 
Property / cites work: A new planarity test / rank
 
Normal rank
Property / cites work
 
Property / cites work: The sizes of maximal planar, outerplanar, and bipartite planar subgraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Better Approximation Algorithm for Finding Planar Subgraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Branch-and-bound techniques for the maximum planar subgraph problem<sup>∗</sup> / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimization by Simulated Annealing: An Experimental Evaluation; Part I, Graph Partitioning / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4495496 / 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: Q4347284 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4339078 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fully dynamic planarity testing with applications / rank
 
Normal rank

Latest revision as of 16:55, 7 June 2024

scientific article; zbMATH DE number 2123965
Language Label Description Also known as
English
A simulated annealing algorithm for the maximum planar subgraph problem
scientific article; zbMATH DE number 2123965

    Statements

    A simulated annealing algorithm for the maximum planar subgraph problem (English)
    0 references
    0 references
    29 December 2004
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    simulated annealing
    0 references
    maximum planar subgraph
    0 references
    graph planarization
    0 references
    0 references