No label defined (Q3304140)

From MaRDI portal

Revision as of 05:24, 23 July 2024 by ReferenceBot (talk | contribs) (‎Changed an Item)

(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

Jump to:navigation, search

scientific article

Language	Label	Description	Also known as
English	No label defined	scientific article

Statements

scholarly article

0 references

0 references

Tomoaki Ogasawara

0 references

0 references

publication date

5 August 2020

0 references

full work available at URL

https://arxiv.org/abs/1710.04376

0 references

zbMATH Keywords

fully polynomial FPT algorithm

0 references

tree-depth

0 references

divide-and-conquer

0 references

MaRDI profile type

MaRDI publication profile

0 references

Subcubic Equivalences Between Graph Centrality Problems, APSP and Diameter

0 references

Approximation and Fixed Parameter Subquadratic Algorithms for Radius and Diameter in Sparse Graphs

0 references

0 references

Rankings of Graphs

0 references

Shortest paths in digraphs of small treewidth. I: Sequential algorithms

0 references

Reachability and Distance Queries via 2-Hop Labels

0 references

Paths, Trees, and Flowers

0 references

Fully polynomial-time parameterized computations for graphs and matrices of low treewidth

0 references

0 references

A linear-time algorithm for a special case of disjoint set union

0 references

Faster scaling algorithms for general graph matching problems

0 references

Polynomial fixed-parameter algorithms: a case study for longest path on interval graphs

0 references

Improved algorithms for the \(k\) simple shortest paths and the replacement paths problems

0 references

On the difficulty of some shortest path problems

0 references

Finding the Hidden Path: Time Bounds for All-Pairs Shortest Paths

0 references

Ordered colourings

0 references

Applications of a Planar Separator Theorem

0 references

The k most vital arcs in the shortest path problem

0 references

Sparsity. Graphs, structures, and algorithms

0 references

Tree-depth, subgraph coloring and homomorphism bounds

0 references

An <i>O</i>(<i>nm</i>) time algorithm for finding the min length directed cycle in a graph

0 references

Computing All-Pairs Shortest Paths by Leveraging Low Treewidth

0 references

Replacement paths and <i>k</i> simple shortest paths in unweighted directed graphs

0 references

Optimal node ranking of tree in linear time

0 references

Combinatorial optimization. Polyhedra and efficiency (3 volumes)

0 references

A theory of alternating paths and blossoms for proving correctness of the \(O(\sqrt{V}E)\) general graph maximum matching algorithm

0 references

Identifiers

zbMATH Open document ID

0 references

10.4230/LIPIcs.STACS.2018.41

0 references

Mathematics Subject Classification ID

0 references

0 references

0 references

0 references

zbMATH DE Number

0 references

0 references

Sitelinks

Mathematics(1 entry)

mardi Publication:3304140

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q3304140&oldid=36605222"