Sciweavers

895 search results - page 29 / 179
» Using graphs for some discrete tomography problems
Sort
View
ESA
2009
Springer
98views Algorithms» more  ESA 2009»
14 years 3 months ago
Reconstructing 3-Colored Grids from Horizontal and Vertical Projections Is NP-hard
We consider the problem of coloring a grid using k colors with the restriction that in each row and each column has an specific number of cells of each color. In an already classi...
Christoph Dürr, Flavio Guiñez, Mart&ia...
IWPEC
2004
Springer
14 years 1 months ago
Parameterized Coloring Problems on Chordal Graphs
In the precoloring extension problem (PrExt) a graph is given with some of the vertices having a preassigned color and it has to be decided whether this coloring can be extended to...
Dániel Marx
DCC
2007
IEEE
14 years 8 months ago
Structure induction by lossless graph compression
This work is motivated by the necessity to automate the discovery of structure in vast and evergrowing collection of relational data commonly represented as graphs, for example ge...
Leonid Peshkin
CINQ
2004
Springer
182views Database» more  CINQ 2004»
14 years 8 days ago
Mining Constrained Graphs: The Case of Workflow Systems
Abstract. Constrained graphs are directed graphs describing the control flow of processes models. In such graphs, nodes represent activities involved in the process, and edges the ...
Gianluigi Greco, Antonella Guzzo, Giuseppe Manco, ...
JAIR
1998
92views more  JAIR 1998»
13 years 8 months ago
The Gn, m Phase Transition is Not Hard for the Hamiltonian Cycle Problem
Using an improved backtrack algorithm with sophisticated pruning techniques, we revise previous observations correlating a high frequency of hard to solve Hamiltonian cycle instan...
Basil Vandegriend, Joseph C. Culberson