2012•Journal of Computer and System SciencesOpen access

A linear vertex kernel for maximum internal spanning tree

Fedor V. Fomin, Serge Gaspers, Saket Saurabh, Stéphan Thomassé

Open full text 78 citations

Abstract

This record does not include an abstract. Use the full-text link above if available.

About this research paper

What this paper is about

An abstract is not available in the OpenAlex record for this paper.

Why it matters

OpenAlex reports 78 citations for this work. Citation counts describe recorded attention and do not establish research quality.

Key contribution

A contribution statement is not available in the OpenAlex record.

Method / approach

Method details are not available in the OpenAlex metadata.

Main findings

Findings are not separately available in the OpenAlex metadata.

Limitations

Limitations are not available in the OpenAlex metadata.

Applications

Application details are not available in the OpenAlex metadata.

Key concepts: Combinatorics, Spanning tree, Mathematics, Minimum degree spanning tree, Vertex (graph theory), Partition (number theory), Hypergraph, Discrete mathematics

Back to paper search Browse research topics Original source

A linear vertex kernel for maximum internal spanning tree — Research Paper | ScholarLens