RSS

Sort by » relevance date activity ▲ answers votes

1027 questions

124

views

answer

vote

2025-07-01 20:40:55 +0200 Cynthia

Groebner basis computation extremely slow

grobner-basis
parallelization
computation_time

939

views

answers

votes

2025-07-11 06:41:25 +0200 licheng

Finding a spanning subgraph that satisfies a given condition

graphtheory

views

answer

votes

2025-07-13 13:29:06 +0200 licheng

Test if a graph is vertex pancyclic

graph
graphtheory

views

answer

votes

2025-08-06 10:44:00 +0200 David Coudert

How to find the graph(s) with a perfect matching from the following collection whose adjacency spectral radius is maximum?

views

answer

vote

2025-08-09 18:18:57 +0200 David Coudert

Algorithm for listing minimal directed cuts and minimal dijoins

directed-graphs
algorithm

425

views

answers

votes

2025-09-07 21:33:33 +0200 Anonymous

Eigenvalues changing at only one position [closed]

410

views

answers

votes

2025-09-07 22:13:19 +0200 Max Alekseyev

1027 questions

Groebner basis computation extremely slow

Finding a spanning subgraph that satisfies a given condition

Test if a graph is vertex pancyclic

How to find the graph(s) with a perfect matching from the following collection whose adjacency spectral radius is maximum?

Algorithm for listing minimal directed cuts and minimal dijoins

Eigenvalues changing at only one position [closed]

Eigenvalues changing at only one position

Contributors

Tags