Searching Cycle-Disjoint Graphs

Lecture Notes in Computer Science - Germany
doi 10.1007/978-3-540-73556-4_6
Full Text
Abstract

Available in full text

Date

Unknown

Authors
Publisher

Springer Berlin Heidelberg

Related search

Disjoint Identifying-Codes for Arbitrary Graphs

2005English

Finding Disjoint Paths on Directed Acyclic Graphs

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2005English

Arc-Disjoint In-Trees in Directed Graphs

Combinatorica
CombinatoricsComputational MathematicsDiscrete Mathematics
2009English

Induced Disjoint Paths in Claw-Free Graphs

SIAM Journal on Discrete Mathematics
Mathematics
2015English

Corrigendum: Edge-Disjoint Paths in Expander Graphs

SIAM Journal on Computing
MathematicsComputer Science
2001English

Complexity of Disjoint Paths Problems in Planar Graphs

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
1993English

A Characterization of Graphs With Disjoint Total Dominating Sets

Ars Mathematica Contemporanea
AlgebraCombinatoricsNumber TheoryGeometryDiscrete MathematicsTheoretical Computer ScienceTopology
2019English

Computing Vertex-Disjoint Paths in Large Graphs Using MAOs

Algorithmica
Applied MathematicsComputer Science ApplicationsComputer Science
2019English

Disjoint Sets in Graphs and Its Application to Electrical Networks

Journal of Mathematics and Statistics
MathematicsStatisticsProbability
2011English

Amanote Research

Note-taking for researchers

Follow Amanote

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

Privacy PolicyRefund Policy