In mathematics, and more specifically in graph theory, a graph is a structure amounting to a set of objects in which some pairs of the objects are inâ€¦Â (More)

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

Highly Cited

2007

Highly Cited

2007

- FranÃ§ois Fouss, Alain Pirotte, Jean-Michel Renders, Marco Saerens
- IEEE Transactions on Knowledge and Dataâ€¦
- 2007

This work presents a new perspective on characterizing the similarity between elements of a database or, more generally, nodes ofâ€¦Â (More)

Is this relevant?

Highly Cited

2006

Highly Cited

2006

- Fabian Kuhn, Roger Wattenhofer
- PODC
- 2006

Coloring the nodes of a graph with a small number of colors is one of the most fundamental problems in theoretical computerâ€¦Â (More)

Is this relevant?

Highly Cited

2003

Highly Cited

2003

- Gary William Flake, Robert E. Tarjan, Kostas Tsioutsiouliklis
- Internet Mathematics
- 2003

In this paper, we introduce simple graph clustering methods based on minimum cuts within the graph. The clustering methods areâ€¦Â (More)

Is this relevant?

Highly Cited

2003

Highly Cited

2003

- Akihiro Inokuchi, Takashi Washio, Hiroshi Motoda
- Machine Learning
- 2003

Basket Analysis, which is a standard method for data mining, derives frequent itemsets from database. However, its mining abilityâ€¦Â (More)

Is this relevant?

Highly Cited

1999

Highly Cited

1999

- David F. Anderson, Philip S. Livingston
- 1999

Å½ . Å½ . Let R be a commutative ring with 1 and let Z R be its set of Å½ . Å½ . zero-divisors. We associate a simple graph G R to Râ€¦Â (More)

Is this relevant?

Highly Cited

1996

Highly Cited

1996

- Ehud Friedgut, Jeffry N. Kahn, Gil Kalai
- 1996

In their seminal work which initiated random graph theory ErdÃ¶s and RÃ©nyi discovered that many graph properties have sharpâ€¦Â (More)

Is this relevant?

Highly Cited

1989

Highly Cited

1989

- Ashok K. Chandra, Prabhakar Raghavan, Walter L. Ruzzo, Roman Smolensky, Prasoon Tiwari
- computational complexity
- 1989

View an <italic>n</italic>-vertex, <italic>m</italic>-edge undirected graph as an electrical network with unit resistors as edgesâ€¦Â (More)

Is this relevant?

Highly Cited

1988

Highly Cited

1988

- Shinji Umeyama
- IEEE Trans. Pattern Anal. Mach. Intell.
- 1988

Absfruct-This paper discusses an approximate solution to the weighted graph matching prohlem (WGMP) for both undirected andâ€¦Â (More)

Is this relevant?

Highly Cited

1973

Highly Cited

1973

- Coen Bron, Joep Kerbosch
- CACM
- 1973

Description bttroductian. A maximal complete subgraph (clique) is a complete subgraph that is not contained in any other completeâ€¦Â (More)

Is this relevant?

Highly Cited

1972

Highly Cited

1972

- Fanica Gavril
- SIAM J. Comput.
- 1972

A finite undirected graph is called chordal if every simple circuit has a chord. Given a chordal graph, we present ways forâ€¦Â (More)

Is this relevant?