In graph theory, a factor of a graph G is a spanning subgraph, i.e., a subgraph that has the same vertex set as G. A k-factor of a graph is aâ€¦Â (More)

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

Highly Cited

2013

Highly Cited

2013

- Amr Ahmed, Nino Shervashidze, Shravan M. Narayanamurthy, Vanja Josifovski, Alexander J. Smola
- WWW
- 2013

Natural graphs, such as social networks, email graphs, or instant messaging patterns, have become pervasive through the internetâ€¦Â (More)

Is this relevant?

2013

2013

- Ekaterina Shutova, Lin Sun
- HLT-NAACL
- 2013

We present a novel approach to automatic metaphor identification, that discovers both metaphorical associations and metaphoricalâ€¦Â (More)

Is this relevant?

2011

2011

- Lin Sun, Anna Korhonen
- EMNLP
- 2011

Most previous research on verb clustering has focussed on acquiring flat classifications from corpus data, although many manuallyâ€¦Â (More)

Is this relevant?

2004

2004

Through Monte Carlo simulation, small sample methods for evaluating overall data-model fit in structural equation modeling wereâ€¦Â (More)

Is this relevant?

Highly Cited

1999

Highly Cited

1999

- Lihao Xu, Vasken Bohossian, Jehoshua Bruck, David G. Wagner
- IEEE Trans. Information Theory
- 1999

Abstmct We reveal an equivalence relation between the construction of a new class of low density MDS array codes, that we call Bâ€¦Â (More)

Is this relevant?

Highly Cited

1998

Highly Cited

1998

Using market European option prices, a method for computing a smooth local volatility function in a 1-factor continuous diffusionâ€¦Â (More)

Is this relevant?

Highly Cited

1997

Highly Cited

1997

- Peter W. Shor
- SIAM J. Comput.
- 1997

A digital computer is generally believed to be an efficient universal computing device; that is, it is believed able to simulateâ€¦Â (More)

Is this relevant?

1992

1992

- Franz Aurenhammer, Johann Hagauer, Wilfried Imrich
- computational complexity
- 1992

LetG be a connected graph withn vertices andm edges. We develop an algorithm that finds the (unique) prime factors ofG withâ€¦Â (More)

Is this relevant?

1979

1979

- By P. D. SEYMOUR, Paul D. Seymour
- 1979

1. Introduction It is well known that the Petersen graph is not 3-edge-colourable; that is, if we regard its 1-factors as (0, lâ€¦Â (More)

Is this relevant?

Highly Cited

1976