In graph theory, a branch of mathematics, a chordal completion of a given undirected graph G is a chordal graph on the same vertex set that has G asâ€¦Â (More)

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

2016

2016

David Bergman Operations and Information Management, University of Connecticut, Storrs, Connecticut 06260 david.bergman@businessâ€¦Â (More)

Is this relevant?

2015

2015

- David Bergman, Arvind U. Raghunathan
- CPAIOR
- 2015

This paper introduces an integer programming approach to the minimum chordal completion problem. This combinatorial optimizationâ€¦Â (More)

Is this relevant?

2014

2014

- Yixin Cao, DÃ¡niel Marx
- Algorithmica
- 2014

Graph modification problems typically ask for a small set of operations that transforms a given graph to have a certain propertyâ€¦Â (More)

Is this relevant?

2009

2009

- Klaus Keimel, Jimmie D. Lawson
- Ann. Pure Appl. Logic
- 2009

In this article we study a type of directed completion for posets and T0-spaces introduced by O. Wyler [Wy81] that we call the Dâ€¦Â (More)

Is this relevant?

2002

2002

- Hans-Peter A. KÃ¼nzi, Michel P. Schellekens
- Theor. Comput. Sci.
- 2002

Several theories aimed at reconciling the partial order and the metric space approaches to Domain Theory have been presented inâ€¦Â (More)

Is this relevant?

2002

2002

One of the simplest associative memories is the Willshaw Network (Willshaw, Buneman & Longuet-Higgins, 1969). Like otherâ€¦Â (More)

Is this relevant?

Highly Cited

1999

Highly Cited

1999

- Haim Kaplan, Ron Shamir, Robert E. Tarjan
- SIAM J. Comput.
- 1999

We study the parameterized complexity of three NP hard graph completion problems The MINIMUM FILL IN problem is to decide if aâ€¦Â (More)

Is this relevant?

1999

1999

- J.-P. St.-Maurice, R. S. Kissack
- 1999

It is becoming increasingly clear that electron thermal eÂ€ects have to be taken into account when dealing with the theory ofâ€¦Â (More)

Is this relevant?

1993

1993

- K. Wendy Tang, Bruce W. Arden
- SIAM J. Discrete Math.
- 1993

There is a continuing search for dense (6, D) interconnection graphs, that is, regular, bidirectional, degree 6 graphs withâ€¦Â (More)

Is this relevant?

Highly Cited

1989

Highly Cited

1989

We present an \unfailing" extension of the standard KnuthBendix completion procedure that is guaranteed to produce a desiredâ€¦Â (More)

Is this relevant?