Titlebook: Combinatorial Algorithms; 31st International W Leszek Gąsieniec,Ralf Klasing,Tomasz Radzik Conference proceedings 2020 Springer Nature Swit

intern

书目名称Combinatorial Algorithms影响因子(影响力)




书目名称Combinatorial Algorithms影响因子(影响力)学科排名




书目名称Combinatorial Algorithms网络公开度




书目名称Combinatorial Algorithms网络公开度学科排名




书目名称Combinatorial Algorithms被引频次




书目名称Combinatorial Algorithms被引频次学科排名




书目名称Combinatorial Algorithms年度引用




书目名称Combinatorial Algorithms年度引用学科排名




书目名称Combinatorial Algorithms读者反馈




书目名称Combinatorial Algorithms读者反馈学科排名

比目鱼

A Family of Tree-Based Generators for Bubbles in Directed Graphspresent interesting biological events, such as alternative splicing (AS) and allelic differences (SNPs and indels). However, the set of all bubbles in a de Bruijn graph built from real data is usually too large to be efficiently enumerated and analysed in practice. In particular, despite significant

Throttle

大方不好

engrave

小故事

小故事

Nonexistence Certificates for Ovals in a Projective Plane of Order Tens do not exist. However, no nonexistence certificates were produced by this search, and to the best of our knowledge the search has never been independently verified. In this paper, we rerun the search for ovals in a projective plane of order ten and produce a collection of nonexistence certificates

小故事

Edge-Disjoint Branchings in Temporal Graphsction on .(.) that tells for each . when . and . are linked. Given a static digraph ., and a subset ., a spanning branching with root . is a subdigraph of . that has exactly one path from . to each .. In this paper, we consider the temporal version of Edmonds’ classical result about the problem of f

广大

Optimal In-place Algorithms for Basic Graph Problemsadth-first search, maximum cardinality search), connectivity problems (like biconnectivity, 2-edge connectivity), decomposition problem (like chain decomposition) among various others, improving the running time (by polynomial multiplicative factor) of the recent results of Chakraborty et al. [ESA,

Offbeat

Further Results on Online Node- and Edge-Deletion Problems with Adviceph in a given graph class at all times. We consider graph classes that can be characterized by forbidden sets of induced subgraphs and analyze the advice complexity of getting an optimal solution. We give almost tight lower and upper bounds for the., where there is one forbidden induced subgraph tha