Saved in:
| Main Authors: | Corneil, Derek, Habib, Michel, Paul, Christophe, Tedder, Marc |
|---|---|
| Format: | Preprint |
| Published: |
2007
|
| Subjects: | |
| Online Access: | https://arxiv.org/abs/0710.3901 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Similar Items
Recoloring via modular decomposition
by: Belavadi, Manoj, et al.
Published: (2024)
by: Belavadi, Manoj, et al.
Published: (2024)
Circle graphs can be recognized in linear time
by: Paul, Christophe, et al.
Published: (2025)
by: Paul, Christophe, et al.
Published: (2025)
Almost-linear time parameterized algorithm for rankwidth via dynamic rankwidth
by: Korhonen, Tuukka, et al.
Published: (2024)
by: Korhonen, Tuukka, et al.
Published: (2024)
Tree-layout based graph classes: proper chordal graphs
by: Paul, Christophe, et al.
Published: (2022)
by: Paul, Christophe, et al.
Published: (2022)
Complexity results on the decomposition of a digraph into directed linear forests and out-stars
by: Hörsch, Florian, et al.
Published: (2024)
by: Hörsch, Florian, et al.
Published: (2024)
Tree-partitions and small-spread tree-decompositions
by: Distel, Marc, et al.
Published: (2026)
by: Distel, Marc, et al.
Published: (2026)
A linear-time algorithm for $(1+ε)Δ$-edge-coloring
by: Bernshteyn, Anton, et al.
Published: (2024)
by: Bernshteyn, Anton, et al.
Published: (2024)
Extending Ghouila-Houri's Characterization of Comparability Graphs to Temporal Graphs
by: Charbit, Pierre, et al.
Published: (2025)
by: Charbit, Pierre, et al.
Published: (2025)
A generic Branch-and-Cut algorithm for bi-objective binary linear programs
by: Fouilhoux, Pierre, et al.
Published: (2024)
by: Fouilhoux, Pierre, et al.
Published: (2024)
Near-linear time subhypergraph counting in bounded degeneracy hypergraphs
by: Paul-Pena, Daniel, et al.
Published: (2025)
by: Paul-Pena, Daniel, et al.
Published: (2025)
Antimagic Labeling of Graphs Using Prime Numbers
by: Islam, Arafat, et al.
Published: (2024)
by: Islam, Arafat, et al.
Published: (2024)
Planar induced paths via a decomposition into non-crossing ordered graphs
by: Duron, Julien, et al.
Published: (2025)
by: Duron, Julien, et al.
Published: (2025)
Approximating temporal modularity on graphs of small underlying treewidth
by: Agdur, Vilhelm, et al.
Published: (2025)
by: Agdur, Vilhelm, et al.
Published: (2025)
On coarse tree decompositions and coarse balanced separators
by: Abrishami, Tara, et al.
Published: (2025)
by: Abrishami, Tara, et al.
Published: (2025)
Strongly k-recursive sequences
by: Krenn, Daniel, et al.
Published: (2024)
by: Krenn, Daniel, et al.
Published: (2024)
Bow Metrics and Hyperbolicity
by: Dragan, Feodor F., et al.
Published: (2024)
by: Dragan, Feodor F., et al.
Published: (2024)
A heuristic search algorithm for discovering large Condorcet domains
by: Zhou, Bei, et al.
Published: (2023)
by: Zhou, Bei, et al.
Published: (2023)
Secure Domination in Bisplit graphs -- A Structural and algorithmic study
by: D, Swathi, et al.
Published: (2025)
by: D, Swathi, et al.
Published: (2025)
An orderly algorithm for generation of Condorcet Domains
by: Zhou, Bei, et al.
Published: (2025)
by: Zhou, Bei, et al.
Published: (2025)
Certified algorithms for numerical semigroups in Rocq
by: Bartoletti, Massimo, et al.
Published: (2025)
by: Bartoletti, Massimo, et al.
Published: (2025)
Tree decompositions with small width, spread, order and degree
by: Wood, David R.
Published: (2025)
by: Wood, David R.
Published: (2025)
Trade-off between spread and width for tree decompositions
by: Bodlaender, Hans L., et al.
Published: (2026)
by: Bodlaender, Hans L., et al.
Published: (2026)
Testing popularity in linear time via maximum matching
by: Bérczi-Kovács, Erika, et al.
Published: (2023)
by: Bérczi-Kovács, Erika, et al.
Published: (2023)
Tree decompositions whose trees are subgraphs: An application of Simon's factorization
by: Bourneuf, Romain, et al.
Published: (2026)
by: Bourneuf, Romain, et al.
Published: (2026)
On the Vertices of Delta-modular Polyhedra
by: Mikhail, Bludov, et al.
Published: (2025)
by: Mikhail, Bludov, et al.
Published: (2025)
Approximation algorithms for job scheduling with block-type conflict graphs
by: Furmańczyk, Hanna, et al.
Published: (2022)
by: Furmańczyk, Hanna, et al.
Published: (2022)
Conditional Separation as a Binary Relation. A Coq Assisted Proof
by: Chancelier, Jean-Philippe, et al.
Published: (2021)
by: Chancelier, Jean-Philippe, et al.
Published: (2021)
Elementary methods for splitting representations of Rook monoids: a gentle introduction to groupoids
by: Duchamp, Gérard Henry Edmond, et al.
Published: (2024)
by: Duchamp, Gérard Henry Edmond, et al.
Published: (2024)
Faster algorithms for graph homomorphism via tractable constraint satisfaction
by: Carbonnel, Clément
Published: (2026)
by: Carbonnel, Clément
Published: (2026)
Faster algorithms on linear delta-matroids
by: Koana, Tomohiro, et al.
Published: (2024)
by: Koana, Tomohiro, et al.
Published: (2024)
An incremental exact algorithm for the hyper-rectangular clustering problem with axis-parallel clusters
by: Donne, Diego Delle, et al.
Published: (2024)
by: Donne, Diego Delle, et al.
Published: (2024)
A verified implementation of the Misra and Gries edge coloring algorithm
by: Bhoja, Arohee
Published: (2025)
by: Bhoja, Arohee
Published: (2025)
The Closed Geodetic Game: algorithms and strategies
by: Dailly, Antoine, et al.
Published: (2024)
by: Dailly, Antoine, et al.
Published: (2024)
Karp's patching algorithm on dense digraph
by: Frieze, Alan
Published: (2025)
by: Frieze, Alan
Published: (2025)
Modeling energy collection with shortest paths in rectangular grids: an efficient algorithm for energy harvesting
by: Díaz-Bañez, José-Miguel, et al.
Published: (2025)
by: Díaz-Bañez, José-Miguel, et al.
Published: (2025)
Switched max-plus linear-dual inequalities: cycle time analysis and applications
by: Zorzenon, Davide, et al.
Published: (2023)
by: Zorzenon, Davide, et al.
Published: (2023)
On the periodic decompositions of multidimensional configurations
by: Herva, Pyry, et al.
Published: (2024)
by: Herva, Pyry, et al.
Published: (2024)
A Caro-Wei bound for induced linear forests in graphs
by: Joret, Gwenaël, et al.
Published: (2024)
by: Joret, Gwenaël, et al.
Published: (2024)
Fast algorithm for $S$-packing coloring of Halin graphs
by: Zhang, Xin, et al.
Published: (2025)
by: Zhang, Xin, et al.
Published: (2025)
Minimum projective linearizations of trees in linear time
by: Alemany-Puig, Lluís, et al.
Published: (2021)
by: Alemany-Puig, Lluís, et al.
Published: (2021)
Similar Items
-
Recoloring via modular decomposition
by: Belavadi, Manoj, et al.
Published: (2024) -
Circle graphs can be recognized in linear time
by: Paul, Christophe, et al.
Published: (2025) -
Almost-linear time parameterized algorithm for rankwidth via dynamic rankwidth
by: Korhonen, Tuukka, et al.
Published: (2024) -
Tree-layout based graph classes: proper chordal graphs
by: Paul, Christophe, et al.
Published: (2022) -
Complexity results on the decomposition of a digraph into directed linear forests and out-stars
by: Hörsch, Florian, et al.
Published: (2024)