Skip to search formSkip to main content

You are currently offline. Some features of the site may not work correctly.

Semantic Scholar uses AI to extract papers important to this topic.

2014

2014

Abstract A decomposition C = { C 1 , C 2 , … , C h } of the complete k -uniform hypergraph K n k of order n is called cyclic… Expand

Is this relevant?

2010

2010

Let m"1,m"2,...,m"t be a list of integers. It is shown that there exists an integer N such that for all n>=N, the complete graph… Expand

Is this relevant?

Highly Cited

2009

Highly Cited

2009

Recent work on trend-cycle decompositions for US real GDP yields the following puzzling features: methods based on Unobserved… Expand

Is this relevant?

2009

2009

The sort transform (ST) is a modification of the Burrows-Wheeler transform (BWT). Both transformations map an arbitrary word of… Expand

Is this relevant?

2007

2007

A k-cycle decomposition of a complete multipartite graph is said to be gregarious if each k-cycle in the decomposition has its… Expand

Is this relevant?

Highly Cited

2001

Highly Cited

2001

We implement various computations in the braid groups via practically efficient and theoretically optimized algorithms whose… Expand

Is this relevant?

1997

1997

In this paper we focus on tests and constructions of irreducible polynomials over finite fields. We revisit Rabin’s (1980… Expand

Is this relevant?

1993

1987

1987

Abstract Sabidussi's Conjecture states that given an Euler trail T in a connected Euler graph, there always exists a cycle… Expand

Is this relevant?

1981

1981

In this paper, we discuss the sign stability and the potential stability for the linear time invarient system described by dx/dt… Expand

Is this relevant?