Publications related to Degeneracy (graph theory)

Saturated simple and k-simple topological graphs

A simple topological graph G is a graph drawn in the plane so that any pair of edges have at most one point in common, which is either an endpoint or a proper crossing. G is called saturated if no further edge can be added without violating this condition. ...

Elsevier Science Bv2015

Imaginary-time nonuniform mesh method for solving the multidimensional Schroedinger equation: Fermionization and melting of quantum Lennard-Jones crystals

Jiri Vanicek, Alberto Hernando de Castro

An imaginary-time nonuniform mesh method for diagonalizing multidimensional quantum Hamiltonians is proposed and used to find the first 50 eigenstates and energies of up to D=5 strongly interacting spinless quantum Lennard-Jones particles trapped in a one- ...

2013

On the Sparsity of Wavelet Coefficients for Signals on Graphs

Pierre Vandergheynst, Benjamin Ricaud, David Shuman

A number of new localized, multiscale transforms have recently been introduced to analyze data residing on weighted graphs. In signal processing tasks such as regularization and compression, much of the power of classical wavelets on the real line is deriv ...

Spie-Int Soc Optical Engineering2013

A Windowed Graph Fourier Transform

Pierre Vandergheynst, Benjamin Ricaud, David Shuman

The prevalence of signals on weighted graphs is increasing; however, because of the irregular structure of weighted graphs, classical signal processing techniques cannot be directly applied to signals on graphs. In this paper, we define generalized transla ...

Ieee2012

A Windowed Graph Fourier Transform

Pierre Vandergheynst, Benjamin Ricaud, David Shuman

The prevalence of signals on weighted graphs is increasing; however, because of the irregular structure of weighted graphs, classical signal processing techniques cannot be directly applied to signals on graphs. In this paper, we define generalized transla ...

IEEE2012

MARGIN: Maximal frequent subgraph mining

Ramachandra Satyanarayana Valluri

The exponential number of possible subgraphs makes the problem of frequent subgraph mining a challenge. The set of maximal frequent subgraphs is much smaller to that of the set of frequent subgraphs providing ample scope for pruning. MARGIN is a maximal su ...

2010

On the power of combinatorial and spectral invariants

We extend the traditional spectral invariants (spectrum and angles) by a stronger polynomial time computable graph invariant based on the angles between projections of standard basis vectors into the eigenspaces (in addition to the usual angles between sta ...

2010

The potential to improve the choice: list conflict-free coloring for geometric hypergraphs

Shakhar Smorodinsky

Given a geometric hypergraph (or a range-space)

H=(V,\cal E)

, a coloring of its vertices is said to be conflict-free if for every hyperedge

S \in \cal E

there is at least one vertex in

S

whose color is distinct from the colors of all other vertices i ...

2010

Optical Flow and Depth from Motion for Omnidirectional Images using a TV-L1 Variational Framework on Graphs

Pascal Frossard, Pierre Vandergheynst, Luigi Bagnato

This paper deals with the problem of efficiently computing the optical flow of image sequences acquired by omnidirectional (nearly full field of view) cameras. We formulate the problem in the natural spherical geometry associated with these devices and ext ...

2009

Graph colouring approaches for a satellite range scheduling problem

Nicolas Zufferey, Patrick Amstutz, Philippe Giaccari

A goal of this paper is to efficiently adapt the best ingredients of the graph colouring techniques to an NP-hard satellite range scheduling problem, called MuRRSP. We propose two new heuristics for the MuRRSP, where as many jobs as possible have to be sch ...

2008

Degeneracy (graph theory)

Graph Chatbot

Chat with Graph Search

Saturated simple and k-simple topological graphs

Imaginary-time nonuniform mesh method for solving the multidimensional Schroedinger equation: Fermionization and melting of quantum Lennard-Jones crystals

On the Sparsity of Wavelet Coefficients for Signals on Graphs

A Windowed Graph Fourier Transform

A Windowed Graph Fourier Transform

MARGIN: Maximal frequent subgraph mining

On the power of combinatorial and spectral invariants

The potential to improve the choice: list conflict-free coloring for geometric hypergraphs

Optical Flow and Depth from Motion for Omnidirectional Images using a TV-L1 Variational Framework on Graphs

Graph colouring approaches for a satellite range scheduling problem

On the power of combinatorial and spectral invariants

On the Sparsity of Wavelet Coefficients for Signals on Graphs

The potential to improve the choice: list conflict-free coloring for geometric hypergraphs

Imaginary-time nonuniform mesh method for solving the multidimensional Schroedinger equation: Fermionization and melting of quantum Lennard-Jones crystals

MARGIN: Maximal frequent subgraph mining

Saturated simple and k-simple topological graphs

Optical Flow and Depth from Motion for Omnidirectional Images using a TV-L1 Variational Framework on Graphs

A Windowed Graph Fourier Transform

A Windowed Graph Fourier Transform

Graph colouring approaches for a satellite range scheduling problem