Search results
From MaRDI portal
- 2005-04-21 Paper Variable neighborhood search for the maximum clique 2005-01-31 Paper Variable neighborhood decomposition search for the edge weighted \(k\)-cardinality...10 bytes (16 words) - 10:59, 11 December 2023
- 2005-04-04 Paper Variable neighborhood search for the maximum clique 2005-01-31 Paper Variable neighborhood decomposition search for the edge weighted \(k\)-cardinality...10 bytes (17 words) - 22:34, 8 December 2023
- \(k\)-restricted edge connected graphs 2016-06-27 Paper \(k\)-restricted edge connectivity in \((p+1)\)-clique-free graphs 2014-12-05 Paper A neighborhood condition...10 bytes (17 words) - 22:21, 10 December 2023
- extra edge-connectivity of hypercubes 2014-04-10 Paper The minimum restricted edge-connected graph and the minimum size of graphs with a given edge-degree...10 bytes (16 words) - 20:23, 8 December 2023
- bottleneck biconnected edge subgraph problem by 2- relative neighborhood graphs 1993-01-16 Paper Efficient algorithms for the maximum weight clique and maximum weight...10 bytes (19 words) - 21:31, 8 December 2023
- 2019-07-24 Paper Largest reduced neighborhood clique cover number revisited 2018-04-23 Paper On the largest reduced neighborhood clique cover number of a graph...10 bytes (16 words) - 17:14, 7 December 2023
- 2011-07-19 Paper Edge-bipancyclicity of the \(k\)-ary \(n\)-cubes with faulty nodes and edges 2011-06-22 Paper Panconnectivity and edge-pancyclicity of...10 bytes (17 words) - 18:12, 11 December 2023
- the access paths. 2003-08-17 Paper On clique-transversals and clique-independent sets 2003-01-27 Paper Edge clique graphs and some classes of chordal graphs...10 bytes (19 words) - 16:28, 9 December 2023
- ideals 2021-02-17 Paper Closed neighborhood ideal of a graph 2020-08-14 Paper Some interpretations for algebraic invariants of edge ideals of hypergraphs via...10 bytes (16 words) - 00:09, 11 December 2023
- and 3-uniform HM-bipartite hypergraphs 2021-05-03 Paper Edge-fault-tolerant strong Menger edge connectivity of bubble-sort star graphs 2021-04-29 Paper...10 bytes (16 words) - 14:55, 9 December 2023
- intersecting cliques 2004-01-06 Paper On ranks of matrices associated with trees 2003-10-16 Paper Second neighborhood via first neighborhood in digraphs...10 bytes (17 words) - 11:58, 9 December 2023
- de/entity/Q5461444 2005-07-26 Paper Self‐clique graphs and matrix permutations 2004-02-03 Paper On clique-transversals and clique-independent sets 2003-01-27 Paper...10 bytes (19 words) - 12:59, 7 October 2023
- the capacitated clustering problem with variable neighborhood search 2019-03-06 Paper Variable Neighborhood Descent for the Capacitated Clustering Problem...10 bytes (16 words) - 11:07, 11 December 2023
- Publication Date of Publication Type The minimum quasi-clique partitioning problem: complexity, formulations, and a computational study 2024-04-11 Paper...10 bytes (18 words) - 16:44, 7 December 2023
- 2015-06-29 Paper https://portal.mardi4nfdi.de/entity/Q5499310 2015-02-11 Paper Edge-connectivity and (signless) Laplacian eigenvalue of graphs 2014-02-19 Paper...10 bytes (17 words) - 22:34, 8 December 2023
- https://portal.mardi4nfdi.de/entity/Q2713606 2001-06-10 Paper Clique covering the edges of a locally cobipartite graph 2000-06-21 Paper On-Line 3-Chromatic...10 bytes (17 words) - 20:14, 8 December 2023
- vertex or edge deletions 2018-04-09 Paper Minimal graphs for matching extensions 2017-12-20 Paper Blocking Independent Sets for H-Free Graphs via Edge Contractions...10 bytes (17 words) - 03:07, 9 December 2023
- Publication Type Landscape properties of the very large-scale and the variable neighborhood search metaheuristics for the multidimensional assignment problem 2024-03-22...10 bytes (20 words) - 02:34, 10 December 2023
- https://portal.mardi4nfdi.de/entity/Q4029984 1993-04-01 Paper On the p-Edge Clique over Nuber of Complete Bipartite Graphs 1993-04-01 Paper https://portal...10 bytes (19 words) - 20:13, 8 December 2023
- https://portal.mardi4nfdi.de/entity/Q3981351 1992-06-26 Paper Neighborhood conditions and edge-disjoint perfect matchings 1992-06-26 Paper https://portal...10 bytes (19 words) - 14:02, 8 December 2023
