Search results

From MaRDI portal
View ( | ) (20 | 50 | 100 | 250 | 500)
  • analysis and numerical comparisons 2023-12-27 Paper Spectral properties of flipped Toeplitz matrices 2023-12-11 Paper One or two frequencies? The iterative...
    10 bytes (19 words) - 09:57, 8 December 2023
  • reweighting for faithful stochastic optimization 2023-11-28 Paper Double Flip Move for Ising Models with Mixed Boundary Conditions 2023-10-16 Paper Approximate...
    10 bytes (17 words) - 04:44, 7 October 2023
  • Paper https://portal.mardi4nfdi.de/entity/Q4547791 2002-08-21 Paper Diagonal flips in labelled planar triangulations 2002-05-20 Paper https://portal.mardi4nfdi...
    10 bytes (18 words) - 12:27, 8 December 2023
  • Interface contents unavailable due to conflicting licenses. zbMATH Keywords diagonal flip\(n\)-angulation Mathematics Subject Classification ID Planar graphs;...
    15 bytes (49 words) - 20:11, 3 February 2024
  • operations over plane trees, Simultaneous diagonal flips in plane triangulations Cites Work Simultaneous diagonal flips in plane triangulations...
    15 bytes (211 words) - 14:59, 2 May 2024
  • left-arm and right-arm rotations, Efficient lower and upper bounds of the diagonal-flip distance between triangulations, A direct algorithm for restricted rotation...
    15 bytes (101 words) - 01:29, 7 February 2024
  • structures (68P05) Related Items Efficient lower and upper bounds of the diagonal-flip distance between triangulations, Refined upper bounds for right-arm rotation...
    15 bytes (106 words) - 01:10, 9 February 2024
  • APX-hard, Rainbow Cycles in Flip Graphs, On flips in planar matchings, Flip distances between graph orientations, Rainbow Cycles in Flip Graphs., An efficient...
    15 bytes (119 words) - 14:34, 6 February 2024
  • Coloring of graphs and hypergraphs (05C15) Related Items On signed diagonal flip sequences, Flips in planar graphs, Some properties of Bowlin and Brin's color...
    15 bytes (116 words) - 11:31, 1 February 2024
  • (05C10) Coloring of graphs and hypergraphs (05C15) Cites Work On signed diagonal flip sequences Partial cubes: Structures, characterizations, and constructions...
    15 bytes (121 words) - 11:49, 2 February 2024
  • computer science (68R10) Cites Work Efficient lower and upper bounds of the diagonal-flip distance between triangulations Steiner tree problems The Steiner tree...
    15 bytes (118 words) - 20:23, 30 January 2024
  • Rainbow Cycles in Flip Graphs Cites Work Expected conflicts in pairs of rooted binary trees Efficient lower and upper bounds of the diagonal-flip distance between...
    15 bytes (150 words) - 15:36, 7 February 2024
  • Coloring of graphs and hypergraphs (05C15) Related Items On signed diagonal flip sequences, Flips in planar graphs, Some properties of Bowlin and Brin's color...
    15 bytes (159 words) - 09:34, 1 February 2024
  • distance is fixed-parameter tractable, Rainbow Cycles in Flip Graphs, On flips in planar matchings, Flip distances between graph orientations, Right-arm rotation...
    15 bytes (177 words) - 08:13, 8 February 2024
  • Distance in graphs (05C12) Related Items Flip distance between two triangulations of a point set is NP-complete, Flip distances between graph orientations...
    15 bytes (178 words) - 05:05, 1 February 2024
  • coefficients and sums of coefficients of \(L\)-functions 2017-05-18 Paper Pairs of diagonal forms of degree \(3^{\tau}.2\) and Artin's conjecture 2017-05-18 Paper...
    10 bytes (16 words) - 10:13, 6 October 2023
  • edge-colouring of binary tree pairs Efficient lower and upper bounds of the diagonal-flip distance between triangulations Right-arm rotation distance between binary...
    15 bytes (182 words) - 15:50, 30 January 2024
  • Uses Software OEIS Cites Work Efficient lower and upper bounds of the diagonal-flip distance between triangulations \(k\)-restricted rotation distance between...
    15 bytes (194 words) - 11:19, 8 February 2024
  • lower and upper bounds of the diagonal-flip distance between triangulations, On the rotation distance between binary trees, Flip graphs of bounded degree triangulations...
    15 bytes (214 words) - 07:52, 8 February 2024
  • Toward a language theoretic proof of the four color theorem On signed diagonal flip sequences Signed permutations and the four color theorem Map coloring...
    15 bytes (211 words) - 19:22, 3 February 2024
View ( | ) (20 | 50 | 100 | 250 | 500)