212 search results - page 34 / 43 » Subgraph Isomorphism in Planar Graphs and Related Problems |
101
Voted
COMBINATORICS
2007
15 years 17 days ago
2007
Each m by m symmetric matrix M over 0, 1, ∗, defines a partition problem, in which an input graph G is to be partitioned into m parts with adjacencies governed by M, in the sen...
103
click to vote
WG
2005
Springer
15 years 6 months ago
2005
Springer
Abstract. We model a problem proposed by Alcatel, a satellite building company, using improper colourings of graphs. The relation between improper colourings and maximum average de...
147
click to vote
LICS
2000
IEEE
15 years 5 months ago
2000
IEEE
We prove that several problems concerning congruences on algebras are complete for nondeterministic log-space. These problems are: determining the congruence on a given algebra gen...
120
Voted
SSPR
2010
Springer
14 years 10 months ago
2010
Springer
Abstract. In order to use structural techniques from graph-based pattern recognition, a first necessary step consists in extracting a graph in an automatic way from an image. We pr...
106
click to vote
ICPP
2008
IEEE
15 years 7 months ago
2008
IEEE
—We consider resource allocation for distributed streaming applications running in a grid environment, where continuously streaming data needs to be aggregated and processed to p...