Search results

From MaRDI portal
View ( | ) (20 | 50 | 100 | 250 | 500)
  • Output-sensitive algorithm for the edge-width of an embedded graph 2014-04-03 Paper Finding shortest non-trivial cycles in directed graphs on surfaces 2014-04-03...
    10 bytes (21 words) - 14:08, 10 December 2023
  • algorithm for shortest path search in directed acyclic graph 2019-07-19 Paper Extension of the hierarchy for \(k\)-OBDDs of small width 2013-07-16 Paper...
    10 bytes (18 words) - 05:33, 7 October 2023
  • 2016-06-16 Paper Clique-width of path powers 2016-04-07 Paper Approximating the Smallest Spanning Subgraph for 2-Edge-Connectivity in Directed Graphs 2015-11-19...
    10 bytes (16 words) - 03:18, 7 October 2023
  • rank-depth 2021-06-18 Paper Half-integral linkages in highly connected directed graphs 2020-05-27 Paper Forcing clique immersions through chromatic number...
    10 bytes (16 words) - 23:39, 9 December 2023
  • Paper Extended path partition conjecture for semicomplete and acyclic compositions 2022-08-24 Paper Component order connectivity in directed graphs 2022-08-18...
    10 bytes (18 words) - 10:09, 8 December 2023
  • mardi4nfdi.de/entity/Q4246748 1999-06-15 Paper Mixed searching and proper-path-width 1997-02-28 Paper https://portal.mardi4nfdi.de/entity/Q4883373 1997-01-05...
    10 bytes (16 words) - 18:27, 6 October 2023
  • 2019-12-19 Paper Finding small-width connected path decompositions in polynomial time 2019-10-16 Paper Clearing directed subgraphs by mobile agents. Variations...
    10 bytes (16 words) - 19:22, 24 September 2023
  • Graph Classes of Perfect Graphs 2014-04-16 Paper Approximating the path-distance-width for AT-free graphs and graphs in related classes 2014-04-02 Paper...
    10 bytes (17 words) - 19:18, 6 October 2023
  • searching and proper-path-width 1997-02-28 Paper Minimal acyclic forbidden minors for the family of graphs with bounded path-width 1994-05-05 Paper Generalization...
    10 bytes (16 words) - 02:03, 7 October 2023
  • Algorithms for Some Classes of Bounded Clique-width Graphs 2019-11-25 Paper Low time complexity algorithms for path computation in Cayley graphs 2019-03-28 Paper...
    10 bytes (16 words) - 23:31, 10 December 2023
  • Paper Characterising \((k,\ell )\)-leaf powers 2010-05-05 Paper Rooted directed path graphs are leaf powers 2010-04-27 Paper Efficient Edge Domination on...
    10 bytes (17 words) - 13:26, 8 December 2023
  • Clique-Width 2020-10-29 Paper Parameterized Complexity of Safe Set 2020-09-04 Paper Independent set reconfiguration parameterized by modular-width 2020-09-03...
    10 bytes (16 words) - 19:22, 6 October 2023
  • fault tolerant networks 2010-11-24 Paper On the Path-Width of Planar Graphs 2010-08-27 Paper WDM and Directed Star Arboricity 2010-04-23 Paper 4-cycles in...
    10 bytes (16 words) - 11:39, 7 October 2023
  • 2023-01-17 Paper Area-width scaling in generalised Motzkin paths 2022-06-20 Paper Skew Schur function representation of directed paths in a slit 2022-02-03...
    10 bytes (16 words) - 02:14, 9 December 2023
  • problem in special graph classes 2019-12-17 Paper Obstructions for linear rank-width at most 1 2014-04-02 Paper Extremal graphs having no matching cuts 2012-02-08...
    10 bytes (18 words) - 11:28, 13 December 2023
  • Network Properties with All-Shortest-Paths Queries 2008-07-10 Paper Cuts and Disjoint Paths in the Valley-Free Path Model 2008-04-29 Paper Domination in...
    10 bytes (17 words) - 16:41, 6 December 2023
  • Paper Backdoors for linear temporal logic 2019-02-14 Paper Clique-Width and Directed Width Measures for Answer-Set Programming 2018-07-12 Paper The complexity...
    10 bytes (17 words) - 02:43, 25 September 2023
  • \(k\)-core problem for directed graphs 2016-03-10 Paper Output-Polynomial Enumeration on Graphs of Bounded (Local) Linear MIM-Width 2016-01-11 Paper Editing...
    10 bytes (19 words) - 23:54, 9 December 2023
  • allows a low tree-width 2-coloring 2004-08-06 Paper Multicuts in unweighted graphs and digraphs with bounded degree and bounded tree-width 2004-03-14 Paper...
    10 bytes (19 words) - 03:26, 9 December 2023
  • computations within bounded clique-width graphs 2022-10-27 Paper Maximum matching in almost linear time on graphs of bounded clique-width 2022-10-27 Paper Eccentricity...
    10 bytes (16 words) - 08:43, 7 October 2023
View ( | ) (20 | 50 | 100 | 250 | 500)