Concept

Topological sorting

Related publications (32)

Some complexity results about threshold graphs

The problem of determining whether a graph G contains a threshold subgraph containing at least h edges is shown to be NP-complete if h is part of the input as the problems of minimum threshold completion, weighted 2-threshold partition and weighted 2-thres ...

1994

2D grain growth viewed as a purely topological phenomenon : models and computational results

Thomas Liebling

Grain growth in 2D polycrystals or similar cellular structures is characterized by interface motions and topological transforamtions. Focusing on the topology of such cell complexes only, regardless of their geometry, they become topological graphs of a gi ...

1989

Graph Chatbot

Chat with Graph Search

Ask any question about EPFL courses, lectures, exercises, research, news, etc. or try the example questions below.

DISCLAIMER: The Graph Chatbot is not programmed to provide explicit or categorical answers to your questions. Rather, it transforms your questions into API requests that are distributed across the various IT services officially administered by EPFL. Its purpose is solely to collect and recommend relevant references to content that you can explore to help you answer your questions.