Finding Shortest Non-Separating and Non-Contractible Cycles for Topologically Embedded Graphs

Lecture Notes in Computer Science - Germany
doi 10.1007/11561071_14
Full Text
Abstract

Available in full text

Date
Authors
Publisher

Springer Berlin Heidelberg

Related search

Finding Cycles With Topological Properties in Embedded Graphs

SIAM Journal on Discrete Mathematics
Mathematics
2011English

Non-Iterative Algorithm for Finding Shortest Route

International Journal of Logistics Economics and Globalisation
2014English

A Strongly Polynomial Algorithm for Finding a Shortest Non-Zero Path in Group-Labeled Graphs

2020English

Enumeration of Hamiltonian Cycles on a Thick Grid Cylinder - Part I: Non-Contractible Hamiltonian Cycles

Applicable Analysis and Discrete Mathematics
CombinatoricsApplied MathematicsAnalysisDiscrete Mathematics
2019English

Finding Large Cycles in Hamiltonian Graphs

Discrete Applied Mathematics
CombinatoricsApplied MathematicsDiscrete Mathematics
2010English

Finding Non-Dominated Bicriteria Shortest Pairs of Disjoint Simple Paths

Computers and Operations Research
Management ScienceSimulationComputer ScienceOperations ResearchModeling
2009English

New Methods for Finding Minimum Genus Embeddings of Graphs on Orientable and Non-Orientable Surfaces

Ars Mathematica Contemporanea
AlgebraCombinatoricsNumber TheoryGeometryDiscrete MathematicsTheoretical Computer ScienceTopology
2019English

Contractible Subgraphs in 3-Connected Graphs

Journal of Combinatorial Theory. Series B
CombinatoricsComputational TheoryDiscrete MathematicsTheoretical Computer ScienceMathematics
2000English

Planar and Non-Planar Graphs

International Journal of Modern Trends in Engineering & Research
2017English

Amanote Research

Note-taking for researchers

Follow Amanote

© 2024 Amaplex Software S.P.R.L. All rights reserved.

Privacy PolicyRefund Policy