An Efficient Algorithm for Enumerating Chordless Cycles and Chordless Paths

An Efficient Algorithm for Enumerating Chordless Cycles and Chordless Paths.

Type

Preprint

Intellectual base

Grey literature

Link

https://arxiv.org/abs/1404.7610

Cited by

1 citation across 1 artifact.

Domain-specific

• Induced Path
  • An ordinary simple path can traverse the same vertices even if the host contains a shortcut edge; that shortcut is precisely what the induced path forbids.

Verification

Does it exist? Not checked yet. This entry carries no identifier to resolve. It was extracted from the citation as written in the article, normalized, and deduplicated against the rest of the registry.

Does it back the claim? Not recorded. The single citation of this work carries no recorded support check.

Support is checked per citation rather than per work — the same source can be cited soundly in one article and wrongly in another. Per-citation recording began recently, so a citation with no recorded check is a gap in the record rather than evidence it went unchecked.

See how references were verified.

Registry ID ref:6f4a2c140642 · see in the full table