O(n^3logn) Time Complexity for the Optimal Consensus Set Computation for 4-Connected Digital Circles

Gaëlle Largeteau-Skapin, Rita Zrour, Eric Andres

Open source

DOI: 10.1007/978-3-642-37067-0_21
Published: 2013-03-20
Container: Not recorded
Publisher: Springer Verlag
Open access: yes

Credibility signals

uncertain Score 51/100 under policy 1.0.0. This is a metadata assessment, not a judgment of the paper's conclusions.

Show all credibility signals

cautionDOI registered: No matching Crossref record was present in this response. Source: Crossref; license: CC0 metadata
cautionDOI resolves: No matching Crossref record was present in this response. Source: Crossref; license: CC0 metadata
not scoredDirectory of Open Access Journals: No matching DOAJ record was present in this response. No allow-list match; this is not evidence of low credibility. Source: DOAJ; license: CC0
not scoredMEDLINE indexed: Not checked or no result supplied; no credibility inference made. Source: No authority result supplied; license: Unknown
not scoredOpenAlex core source: Not checked or no result supplied; no credibility inference made. Source: No authority result supplied; license: Unknown
not scoredKnown publisher allow-list: Not checked or no result supplied; no credibility inference made. Source: No authority result supplied; license: Unknown
not scoredROR affiliation: Not checked or no result supplied; no credibility inference made. Source: No authority result supplied; license: Unknown
not scoredRetraction Watch retraction: No retraction notice matched this DOI in the deployed snapshot. No matching event found; coverage may be incomplete. Source: Retraction Watch; license: CC BY 4.0
not scoredRetraction Watch expression of concern: No expression of concern notice matched this DOI in the deployed snapshot. No matching event found; coverage may be incomplete. Source: Retraction Watch; license: CC BY 4.0
not scoredRetraction Watch correction: No correction notice matched this DOI in the deployed snapshot. No matching event found; coverage may be incomplete. Source: Retraction Watch; license: CC BY 4.0
not scoredRetraction Watch reinstatement: No reinstatement notice matched this DOI in the deployed snapshot. No matching event found; coverage may be incomplete. Source: Retraction Watch; license: CC BY 4.0
supportingOpen access status: Normalized open-access status: open. Source: Normalized work metadata; license: Caller-provided; provenance license not supplied to scorer
not scoredPublication license: Not checked or no result supplied; no credibility inference made. Source: No authority result supplied; license: Unknown
not scoredPublication version: A publication version was supplied but is not scored. Source: Normalized work metadata; license: Caller-provided; provenance license not supplied to scorer
supportingMetadata completeness: All 6 scored descriptive metadata groups are present. Source: Normalized work metadata; license: Caller-provided; provenance license not supplied to scorer

Cite this work

BibTeX

@article{allodium:10.1007/978-3-642-37067-0_21,
  title = {O(n\textasciicircum{}3logn) Time Complexity for the Optimal Consensus Set Computation for 4-Connected Digital Circles},
  author = {Gaëlle Largeteau-Skapin and Rita Zrour and Eric Andres},
  year = {2013},
  doi = {10.1007/978-3-642-37067-0_21},
  url = {https://doi.org/10.1007/978-3-642-37067-0_21}
}

RIS

TY  - JOUR
TI  - O(n^3logn) Time Complexity for the Optimal Consensus Set Computation for 4-Connected Digital Circles
AU  - Gaëlle Largeteau-Skapin
AU  - Rita Zrour
AU  - Eric Andres
PY  - 2013
DO  - 10.1007/978-3-642-37067-0_21
UR  - https://doi.org/10.1007/978-3-642-37067-0_21
ER  -

APA

Largeteau-Skapin, G., Zrour, R., & Andres, E. (2013). O(n^3logn) Time Complexity for the Optimal Consensus Set Computation for 4-Connected Digital Circles. https://doi.org/10.1007/978-3-642-37067-0_21

Source records

hal · retrieved 2026-11-10T11:55:38.697Z