Publication

On the inapproximability of independent domination in 2P3-free perfect graphs

About
Privacy
Disclaimer

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.

On the inapproximability of independent domination in 2P3-free perfect graphs

Graph Chatbot

Chat with Graph Search

SAT-based Exact Modulo Scheduling Mapping for Resource-Constrained CGRAs

Succinct ordering and aggregation constraints in algebraic array theories

Molecular hypergraph neural networks

Maximum Independent Set: Self-Training through Dynamic Programming

Results on Sparse Integer Programming and Geometric Independent Sets

A full characterization of invariant embeddability of unimodular planar graphs

Equivariant Neural Architectures for Representing and Generating Graphs

ON THE INDEPENDENCE NUMBER OF INTERSECTION GRAPHS OF AXIS-PARALLEL SEGMENTS

Acceleration of graph pattern mining and applications to financial crime

Privatized graph federated learning