MétaCan
Menu
Back to cohort
Record W2186560431

Maximum Independent Set for Interval Graphs and Trees in Space Efficient Models.

2014· article· en· W2186560431 on OpenAlexaff
Binay Bhattacharya, Minati De, Subhas C. Nandy, Sasanka Roy

Bibliographic record

VenueCanadian Conference on Computational Geometry · 2014
Typearticle
Languageen
FieldComputer Science
TopicAdvanced Graph Theory Research
Canadian institutionsSimon Fraser University
Fundersnot available
KeywordsInterval (graph theory)Maximal independent setSet (abstract data type)Interval graphCombinatoricsSpace (punctuation)Independent setMathematicsUpper and lower boundsDiscrete mathematicsProduct (mathematics)AlgorithmComputer sciencePathwidthGraphLine graph
DOInot available

Abstract

fetched live from OpenAlex

Space ecient algorithms for the maximum independent set problem for interval graphs and trees are presented in this paper. For a given set of n intervals on a real line, we can compute the maximum independent set in O( n 2 s +n logs) time using O(s) extra-space. The lower bound of the time space product for this problem is ( n 2 ),

Fetched live from OpenAlex and de-inverted. Abstracts are not stored in this database: the inverted indexes are 8.6 GB of the frame’s 9.3 GB of text, and the host has 13 GB free.

How this classification was reachedexpand

Full frame machine prediction

Teacher imitation

Not calibrated prevalence, not ground truth. Human validation pending. The Gemma side is a direct model label for every work in the frame, read from the title-only record. The Codex side is a classifier learned from the 10,348 direct Codex labels and calibrated to design-weighted sample rates; fields without enough sample support carry no Codex call. Candidate is the union of the two sides; consensus is their intersection. These outputs are machine_predicted_unvalidated and are not human labels.

metaresearch head score (Codex)0.003
metaresearch head score (Gemma)0.014
Version: metacan-v3-hybrid-931329e0061cValidation status: machine_predicted_unvalidated
Candidate categoriesnone
Consensus categoriesnone
DomainCandidate signal: none · Consensus signal: none
Study designCandidate signal: Theoretical or conceptual · Consensus signal: Theoretical or conceptual
GenreCandidate signal: Empirical · Consensus signal: none
Teacher disagreement score0.009
Threshold uncertainty score0.030

Distilled classifier scores by category (both heads)

CategoryCodexGemma
Metaresearch0.0030.014
Meta-epidemiology (narrow)0.0010.001
Meta-epidemiology (broad)0.0020.003
Bibliometrics0.0020.004
Science and technology studies0.0010.002
Scholarly communication0.0050.014
Open science0.0040.004
Research integrity0.0020.004
Insufficient payload (model declined to judge)0.0090.001

Machine scores (provisional)

The two teacher heads of the student model, read on this work. A score orders the frame for review; it never asserts a category, and the validation status ships verbatim with every row.

Baseline scores from an immature model (maturity gate not passed, 7 training rounds). Scores rank; they never assert a category.

Opus teacher head0.041
GPT teacher head0.286
Teacher spread0.245 · how far apart the two teachers sit on this one work
Validation statusscore_only:v0-immature-baseline · verbatim from the scoring run: score_only means the number may rank works, and no category label ships from it

Classification

machine, unvalidated

Machine predicted; a candidate call from one source (direct Gemma or distilled Codex), not a consensus.

The models applied no category: nothing in the taxonomy fit this work.
Study designTheoretical or conceptual
Domainnot available
GenreEmpirical

How this classification was reached, model by model and score by score, is at the end of the page under "How this classification was reached".

Quick stats

Citations3
Published2014
Admission routes1
Has abstractyes

Explore more

Same venueCanadian Conference on Computational GeometrySame topicAdvanced Graph Theory ResearchFrench-language works237,207