Multicuts in planar and bounded-genus graphs with bounded number of terminals (Q2408168): Difference between revisions

From MaRDI portal
ReferenceBot (talk | contribs)
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
Property / cites work
 
Property / cites work: Q5743427 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3795218 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Multicut is FPT / rank
 
Normal rank
Property / cites work
 
Property / cites work: Multicuts in unweighted graphs and digraphs with bounded degree and bounded tree-width / rank
 
Normal rank
Property / cites work
 
Property / cites work: Shortest Cut Graph of a Surface with Prescribed Vertex Set / rank
 
Normal rank
Property / cites work
 
Property / cites work: Planar separators and parallel polygon triangulation. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5743478 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Shortest Non-trivial Cycles in Directed and Undirected Surface Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: The planar multiterminal cut problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4819371 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3601569 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graph-encoded maps / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Separator Theorem for Planar Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2726740 / rank
 
Normal rank

Revision as of 12:13, 14 July 2024

scientific article; zbMATH DE number 6511784
  • Multicuts in Planar and Bounded-Genus Graphs with Bounded Number of Terminals
Language Label Description Also known as
English
Multicuts in planar and bounded-genus graphs with bounded number of terminals
scientific article; zbMATH DE number 6511784
  • Multicuts in Planar and Bounded-Genus Graphs with Bounded Number of Terminals

Statements

Multicuts in planar and bounded-genus graphs with bounded number of terminals (English)
0 references
Multicuts in Planar and Bounded-Genus Graphs with Bounded Number of Terminals (English)
0 references
0 references
0 references
10 October 2017
0 references
19 November 2015
0 references
algorithm
0 references
computational topology
0 references
multicut
0 references
planar graph
0 references
surface
0 references
embedding
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references

Identifiers

0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references